A compact linear programming formulation of the maximum concurrent flow problem

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|1|68-87

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.1, 2015-01, pp. : 68-87

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient algorithms for the maximum concurrent flow problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 56-67

John Wiley & Sons Inc

Access to resources Recommend Favorite

Linear Concurrent Constraint Programming: Operational and Phase Semantics

By Fages F.   Ruet P.   Soliman S.  

Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. : 14-41

Academic Press

Access to resources Recommend Favorite

A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data

By Montemanni Roberto  

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 2, 2007-06 ,pp. : 287-296

Springer Publishing Company

Access to resources Recommend Favorite

A Novel Evolutionary Formulation of the Maximum Independent Set Problem

By Barbosa Valmir C.   Campos Luciana C. D.  

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 419-437

Springer Publishing Company

Access to resources Recommend Favorite

Linear Formulation of a Distributed Boundary Control Problem

By Kostreva M.M.   Ward A.L.  

Journal of Optimization Theory and Applications, Vol. 103, Iss. 2, 1999-11 ,pp. : 385-399

Springer Publishing Company

Access to resources Recommend Favorite