Graph Theory and Integer Programming
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Convex programming (90C25) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Applications of graph theory to circuits and networks (94C15)
- Short proofs on the matching polyhedron
- Polyhedral proof methods in combinatorial optimization
- A matching problem with side conditions
- Matchings in regular graphs
- The Steiner tree polytope and related polyhedra
- A compact linear program for testing optimality of perfect matchings.
- Valid inequalities for the single arc design problem with set-ups
- Convex hull results for the warehouse problem
- Matchings and covers in hypergraphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Semi-continuous network flow problems
- Lifting for mixed integer programs with variable upper bounds
- Continuous knapsack sets with divisible capacities
- Relaxations of discrete sets with semicontinuous variables
- Relaxations for two-level multi-item lot-sizing problems
- A polyhedral study of lot-sizing with supplier selection
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
- On the fractional matching polytope of a hypergraph
This page was built for publication: Graph Theory and Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4193501)
