Pages that link to "Item:Q761351"

The following pages link to Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351):

Displayed 13 items.

• Duality for balanced submodular flows (Q581206) ‎ (← links)
• Bounded vertex colorings of graphs (Q686481) ‎ (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) ‎ (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) ‎ (← links)
• On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (Q1147716) ‎ (← links)
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) ‎ (← links)
• A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467) ‎ (← links)
• On search over rationals (Q1170866) ‎ (← links)
• Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) ‎ (← links)
• Projection algorithms for linear programming (Q1199509) ‎ (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) ‎ (← links)
• Minimizing submodular functions over families of sets (Q1906848) ‎ (← links)
• On cycle cones and polyhedra (Q5895283) ‎ (← links)