Integer Programming and Pricing
From MaRDI portal
Cited in
(58)- Valid inequalities for mips and group polyhedra from approximate liftings
- Average shadow price and equilibrium price: a case study of tradable pollution permit markets
- Non-linear anonymous pricing combinatorial auctions
- A shadow price in integer programming for management decision
- A unified approach for price directive decomposition procedures in integer programming
- Average shadow price in a mixed integer linear programming problem
- Some aspects of integer programming duality
- Discrete right hand side parametrization for linear integer programs
- Generalized average shadow prices and bottlenecks
- A pricing scheme for combinatorial auctions based on bundle sizes
- Integer programming as projection
- A relax-and-cut framework for Gomory mixed-integer cuts
- Split closure and intersection cuts
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Subadditive approaches in integer programming
- Local cuts for mixed-integer programming
- Convex analysis in groups and semigroups: a sampler
- New branch-and-Cut algorithm for bilevel linear programming
- A convex-analysis perspective on disjunctive cuts
- Duality in mathematics and linear and integer programming
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- The allocation of shared fixed costs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Two row mixed-integer cuts via lifting
- Parametric methods in integer linear programming
- Critical review of pricing schemes in markets with non-convex costs
- A partitioning method that generates interpretable prices for integer programming problems
- Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme
- Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen
- Pricing combinatorial auctions by a set of linear price vectors
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Integer programming duality: Price functions and sensitivity analysis
- Improved penalty calculations for a mixed integer branch-and-bound algorithm
- scientific article; zbMATH DE number 3557522 (Why is no real title available?)
- Heuristically aided set-covering algorithms
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
- Mixed integer programming: A historical perspective with Xpress-MP
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Revival of the Gomory cuts in the 1990's
- Hooked on IP
- Branching on general disjunctions
- On nonlinear optimization in integers
- Rückgerechnete Duale Variable
- Cut search methods in integer programming
- Classical cuts for mixed-integer programming and branch-and-cut
- On the enumerative nature of Gomory's dual cutting plane method
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Convex analysis in groups and semigroups and applications to separation and optimization
- Efficient market-clearing prices in markets with nonconvexities
- Testing cut generators for mixed-integer linear programming
- On the safety of Gomory cut generators
- Integer-programming software systems
- Conic mixed-integer rounding cuts
- Mixed-integer cuts from cyclic groups
- Equilibrium prices supported by dual price functions in markets with non-convexities
- Stochastic level-value approximation for quadratic integer convex programming
- Mingling: mixed-integer rounding with bounds
- Mixing MIR inequalities with two divisible coefficients
This page was built for publication: Integer Programming and Pricing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3272914)
