Variation of cost functions in integer programming
zbMATH Open0888.90125MaRDI QIDQ1373763FDOQ1373763
Authors: Bernd Sturmfels, Rekha Thomas 
Publication date: 28 January 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Graver basisgeometric algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=reduced+Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go reduced Gr��bner bases]
Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (40)
- Non-standard approaches to integer programming
- The multiparametric 0-1-integer linear programming problem: A unified approach
- On circuit diameter bounds via circuit imbalances
- Test sets for vertex cover problems
- The combinatorics of modeling and analyzing biological systems
- Title not available (Why is that?)
- Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
- Gröbner bases and triangulations of the second hypersimplex
- On the complexity of smooth projective toric varieties
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- On the Gröbner complexity of matrices
- Test sets of integer programs
- Computing generating sets of lattice ideals and Markov bases of lattices
- Computing the integer programming gap
- Supernormal vector configurations
- Test sets for integer programs
- The circuit diameter of the Klee-Walkup polyhedron
- On circuit diameter bounds via circuit imbalances
- Generating functions and duality for integer programs
- Exact Quantization of Multistage Stochastic Linear Problems
- GRIN: An implementation of Gröbner bases for integer programming
- Limit laws for empirical optimal solutions in random linear programs
- On Lawrence semigroups
- Designing optimization problems with diverse solutions
- A note on minimal zero-sum sequences over Z
- Toric varieties and Gröbner bases: the complete \(\mathbb{Q}\)-factorial case
- Vector and matrix apportionment problems and separable convex integer optimization
- The vertex ideal of a lattice.
- Integer hulls of linear polyhedra and scl in families
- Varieties of Cost Functions
- Standard pairs and group relaxations in integer programming
- A polyhedral model for enumeration and optimization over the set of circuits
- On Gröbner basis and Cohen-Macaulay property of closed path polyominoes
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
- Monotone paths on cross-polytopes
- Permutohedra and minimal matrices
- Convex integer maximization via Graver bases
- Title not available (Why is that?)
- Test sets and inequalities for integer programs
- Alternatives for testing total dual integrality
Uses Software
This page was built for publication: Variation of cost functions in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373763)
