Separating multi-oddity constrained shortest circuits over the polytope of stable multisets

Author： Cheng E.   de Vries S.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.32, Iss.2, 2004-03, pp. : 181-184

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

Related content

Separating subsets and stable values

By Illanes A.  

Topology and its Applications, Vol. 126, Iss. 3, 2002-12 ,pp. : 359-360

Elsevier

Access to resources Recommend Favorite

The stable set polytope of quasi-line graphs

By Eisenbrand Friedrich  

Combinatorica, Vol. 28, Iss. 1, 2008-01 ,pp. : 45-67

Springer Publishing Company

Access to resources Recommend Favorite

Resource Constrained Shortest Path Problems in Path Planning for Fleet Management

By Avella Pasquale   Boccia Maurizio   Sforza Antonio  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 1, 2004-01 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite

Robust constrained shortest path problems under budgeted uncertainty

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. : 98-111

John Wiley & Sons Inc

Access to resources Recommend Favorite

A survey of resource constrained shortest path problems: Exact solution approaches

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 62, Iss. 3, 2013-10 ,pp. : 183-200

John Wiley & Sons Inc

Access to resources Recommend Favorite