Polyhedral Combinatorics in Combinatorial Optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A generalization of max flow—min cut
- A strongly polynomial minimum cost circulation algorithm
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Convex Analysis
- Decomposition of regular matroids
- Facets of the linear ordering polytope
- Maximal Flow Through a Network
- Multi-Terminal Network Flows
- On the average number of steps of the simplex method of linear programming
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- On the width-length inequality
- On total dual integrality
- Outline of an algorithm for integer solutions to linear programs
- Paths, Trees, and Flowers
- The Average number of pivot steps required by the Simplex-Method is polynomial
- The ellipsoid method and its consequences in combinatorial optimization
- Total dual integrality and integer polyhedra
Cited in
(28)- Combinatorial Optimization in Pattern Assembly
- scientific article; zbMATH DE number 764212 (Why is no real title available?)
- scientific article; zbMATH DE number 3888925 (Why is no real title available?)
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 480244 (Why is no real title available?)
- Polyhedral combinatorics and combinatorial optimization
- scientific article; zbMATH DE number 3828714 (Why is no real title available?)
- Polyhedral aspects of discrete optimization
- scientific article; zbMATH DE number 3898612 (Why is no real title available?)
- Cyclic group blocking polyhedra
- Polyhedral techniques in combinatorial optimization II: applications and computations
- scientific article; zbMATH DE number 49751 (Why is no real title available?)
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
- Normal Forms and Unfoldings for Local Dynamical Systems
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Polyhedral techniques in combinatorial optimization I: Theory
- Cutting planes in combinatorics
- scientific article; zbMATH DE number 3887434 (Why is no real title available?)
- scientific article; zbMATH DE number 4108497 (Why is no real title available?)
- Polyhedral proof methods in combinatorial optimization
- scientific article; zbMATH DE number 219017 (Why is no real title available?)
- scientific article; zbMATH DE number 24443 (Why is no real title available?)
- Topics of polyhedral combinatorics in transportation problems with exclusions
- Permutatorial optimization via the permutahedron
- scientific article; zbMATH DE number 4187465 (Why is no real title available?)
- Blocking and Antiblocking Polyhedra
This page was built for publication: Polyhedral Combinatorics in Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763906)
