Variation of cost functions in integer programming
From MaRDI portal
Publication:1373763
Recommendations
Cited in
(40)- scientific article; zbMATH DE number 7015150 (Why is no real title available?)
- Limit laws for empirical optimal solutions in random linear programs
- Permutohedra and minimal matrices
- On circuit diameter bounds via circuit imbalances
- Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
- Test sets for vertex cover problems
- Varieties of Cost Functions
- Alternatives for testing total dual integrality
- Computing generating sets of lattice ideals and Markov bases of lattices
- The multiparametric 0-1-integer linear programming problem: A unified approach
- scientific article; zbMATH DE number 7733446 (Why is no real title available?)
- The combinatorics of modeling and analyzing biological systems
- Computing the integer programming gap
- The vertex ideal of a lattice.
- Standard pairs and group relaxations in integer programming
- Test sets and inequalities for integer programs
- Designing optimization problems with diverse solutions
- Integer hulls of linear polyhedra and scl in families
- On the Gröbner complexity of matrices
- Generating functions and duality for integer programs
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Gröbner bases and triangulations of the second hypersimplex
- On Gröbner basis and Cohen-Macaulay property of closed path polyominoes
- Test sets for integer programs
- Convex integer maximization via Graver bases
- A note on minimal zero-sum sequences over Z
- A polyhedral model for enumeration and optimization over the set of circuits
- Test sets of integer programs
- On circuit diameter bounds via circuit imbalances
- The circuit diameter of the Klee-Walkup polyhedron
- Toric varieties and Gröbner bases: the complete \(\mathbb{Q}\)-factorial case
- GRIN: an implementation of Gröbner bases for integer programming
- On Lawrence semigroups
- Vector and matrix apportionment problems and separable convex integer optimization
- Non-standard approaches to integer programming
- Exact Quantization of Multistage Stochastic Linear Problems
- Supernormal vector configurations
- On the complexity of smooth projective toric varieties
- Monotone paths on cross-polytopes
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
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)
