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