Variation of cost functions in integer programming
From MaRDI portal
Publication:1373763
zbMath0888.90125MaRDI QIDQ1373763
Rekha R. Thomas, Bernd Sturmfels
Publication date: 28 January 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity, Computing generating sets of lattice ideals and Markov bases of lattices, The circuit diameter of the Klee-Walkup polyhedron, Gröbner bases and triangulations of the second hypersimplex, Generating functions and duality for integer programs, Test sets for integer programs, Limit laws for empirical optimal solutions in random linear programs, On circuit diameter bounds via circuit imbalances, Unnamed Item, A note on minimal zero-sum sequences over Z, Supernormal vector configurations, GRIN: An implementation of Gröbner bases for integer programming, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Designing optimization problems with diverse solutions, Monotone paths on cross-polytopes, Alternatives for testing total dual integrality, Exact Quantization of Multistage Stochastic Linear Problems, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Unnamed Item, Computing the integer programming gap, Test sets and inequalities for integer programs, Vector and matrix apportionment problems and separable convex integer optimization, Non-standard approaches to integer programming, The combinatorics of modeling and analyzing biological systems, Toric varieties and Gröbner bases: the complete \(\mathbb{Q}\)-factorial case, On Lawrence semigroups, On the Gröbner complexity of matrices, Convex integer maximization via Graver bases, A polyhedral model for enumeration and optimization over the set of circuits, On the complexity of smooth projective toric varieties, Integer hulls of linear polyhedra and scl in families, Standard pairs and group relaxations in integer programming, Test sets of integer programs, On Gröbner basis and Cohen-Macaulay property of closed path polyominoes, Permutohedra and minimal matrices, The multiparametric 0-1-integer linear programming problem: A unified approach, The vertex ideal of a lattice.
Uses Software
