Polyhedral proof methods in combinatorial optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3559289 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- scientific article; zbMATH DE number 3069634 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- A decomposition theorem for partially ordered sets
- A generalization of max flow—min cut
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Decomposition of regular matroids
- Edmonds polytopes and a hierarchy of combinatorial problems
- Elementare Theorie der konvexen Polyeder
- Finding optimum branchings
- Graph Theory and Integer Programming
- How to make a digraph strongly connected
- Local Unimodularity in the Matching Polytope
- Maximal Flow Through a Network
- Maximum matching and a polyhedron with 0,1-vertices
- Normal hypergraphs and the perfect graph conjecture
- Odd Minimum Cut-Sets and b-Matchings
- On Cutting Planes
- On Linear Characterizations of Combinatorial Optimization Problems
- On certain polytopes associated with graphs
- On two minimax theorems in graph
- Optimum branchings
- Outline of an algorithm for integer solutions to linear programs
- Packing rooted directed cuts in a weighted directed graph
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The ellipsoid method and its consequences in combinatorial optimization
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(45)- Polyhedral approaches
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
- Integer programming problems using a polynomial number of variables and constraints for combinatorial optimization problems in graphs
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph
- Normality criteria for monomial ideals
- scientific article; zbMATH DE number 764212 (Why is no real title available?)
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- Polyhedral Combinatorics in Combinatorial Optimization
- Some new results on generalized additive games
- Polyhedral techniques in combinatorial optimization II: applications and computations
- scientific article; zbMATH DE number 49899 (Why is no real title available?)
- On cutting-plane proofs in combinatorial optimization
- An analog of the Cook theorem for polytopes
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- On matching numbers of tree and bipartite degree sequences
- Computing assortative mixing by degree with the s-metric in networks using linear programming
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Polyhedral techniques in combinatorial optimization I: Theory
- scientific article; zbMATH DE number 2159269 (Why is no real title available?)
- Cutting planes in combinatorics
- On line sum optimization
- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Social exchange networks with distant bargaining
- Uncapacitated flow-based extended formulations
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- scientific article; zbMATH DE number 4016609 (Why is no real title available?)
- Generic global rigidity of body-hinge frameworks
- Some efficiently solvable problems over integer partition polytopes
- On the transportation problem with market choice
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Unions of perfect matchings in cubic graphs
- scientific article; zbMATH DE number 5888310 (Why is no real title available?)
- Irreducible decomposition of powers of edge ideals
- Minimum weighted clique cover on claw‐free perfect graphs
- Circular zero-sum r-flows of regular graphs
- Colorful linear programming, Nash equilibrium, and pivots
- A generalization of Robacker's theorem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computing valuations of the Dieudonné determinants
- Combinatorial optimization. Packing and covering
- A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues
- scientific article; zbMATH DE number 4187465 (Why is no real title available?)
- Blocking and Antiblocking Polyhedra
This page was built for publication: Polyhedral proof methods in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082268)
