Pages that link to "Item:Q1168215"

The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):

Displayed 50 items.

• Duality for balanced submodular flows (Q581206) ‎ (← links)
• Algebraic optimization: The Fermat-Weber location problem (Q584057) ‎ (← links)
• The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) ‎ (← links)
• A comparison of two edge-coloring formulations (Q688209) ‎ (← links)
• Pseudo-Boolean optimization (Q697569) ‎ (← links)
• On the core of network synthesis games (Q757264) ‎ (← links)
• A polynomial algorithm for minimum quadratic cost flow problems (Q761341) ‎ (← links)
• Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) ‎ (← links)
• A new polynomial-time algorithm for linear programming (Q761967) ‎ (← links)
• Recent trends in combinatorial optimization (Q788638) ‎ (← links)
• Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) ‎ (← links)
• On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) ‎ (← links)
• On some weakly bipartite graphs (Q800231) ‎ (← links)
• A note on matchings and separability (Q802467) ‎ (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) ‎ (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) ‎ (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) ‎ (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) ‎ (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) ‎ (← links)
• A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) ‎ (← links)
• A lower bound for intuitionistic logic (Q876385) ‎ (← links)
• Approximation algorithms for extensible bin packing (Q880529) ‎ (← links)
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph (Q911485) ‎ (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) ‎ (← links)
• Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) ‎ (← links)
• The mixing-MIR set with divisible capacities (Q930344) ‎ (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) ‎ (← links)
• Partitioning posets (Q943378) ‎ (← links)
• On routing in VLSI design and communication networks (Q944702) ‎ (← links)
• The stable set polytope of quasi-line graphs (Q949780) ‎ (← links)
• George Dantzig's contributions to integer programming (Q951090) ‎ (← links)
• The Grothendieck constant of random and pseudo-random graphs (Q951106) ‎ (← links)
• On the complexity of bandwidth allocation in radio networks (Q952444) ‎ (← links)
• Submodular function minimization (Q995782) ‎ (← links)
• Decomposition of submodular functions (Q1053717) ‎ (← links)
• Brick decompositions and the matching rank of graphs (Q1055426) ‎ (← links)
• Testing membership in matroid polyhedra (Q1056350) ‎ (← links)
• Graph isomorphism and theorems of Birkhoff type (Q1068104) ‎ (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) ‎ (← links)
• Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) ‎ (← links)
• Intelligent gradient search in linear programming (Q1071647) ‎ (← links)
• Small solutions of linear diophantine equations (Q1074620) ‎ (← links)
• Relaxations of vertex packing (Q1078206) ‎ (← links)
• Polyhedral proof methods in combinatorial optimization (Q1082268) ‎ (← links)
• A 71/60 theorem for bin packing (Q1083194) ‎ (← links)
• On randomized stopping points and perfect graphs (Q1085176) ‎ (← links)
• Decomposition and optimization over cycles in binary matroids (Q1089347) ‎ (← links)
• Coloring planar perfect graphs by decomposition (Q1093649) ‎ (← links)
• On a conjecture of Meyniel (Q1096652) ‎ (← links)
• Matrices with the Edmonds-Johnson property (Q1100483) ‎ (← links)