Pages that link to "Item:Q1168215"
From MaRDI portal
The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):
Displaying 50 items.
- 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)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Mind the independence gap (Q776261) (← 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)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← 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)
- Computational implications of reducing data to sufficient statistics (Q887274) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← 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)
- The expressive power of binary submodular functions (Q967393) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Submodular function minimization (Q995782) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
