Integer Programming and Combinatorial Optimization

DOI10.1007/b97946zbMath1092.90038arXivmath/0401313OpenAlexW2484779063MaRDI QIDQ5712467

Alexander V. Karzanov

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0401313

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial optimization (90C27) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Concave cocirculations in a triangular grid ⋮ Discrete strip-concave functions, Gelfand--Tsetlin patterns, and related polyhedra

This page was built for publication: Integer Programming and Combinatorial Optimization