Integer Programming and Pricing
From MaRDI portal
Publication:3272914
DOI10.2307/1910130zbMath0095.14502OpenAlexW2325671244MaRDI QIDQ3272914
William Baumol, Ralph E. Gomory
Publication date: 1960
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fab8d856217c8609a2a3afbfff8f4787beaa8abd
Related Items
On nonlinear optimization in integers, Generalized average shadow prices and bottlenecks, Rückgerechnete Duale Variable, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Subadditive approaches in integer programming, Conic mixed-integer rounding cuts, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Two row mixed-integer cuts via lifting, Unnamed Item, Parametric methods in integer linear programming, Pricing combinatorial auctions by a set of linear price vectors, A pricing scheme for combinatorial auctions based on bundle sizes, A shadow price in integer programming for management decision, A unified approach for price directive decomposition procedures in integer programming, Local cuts for mixed-integer programming, Mixed-integer cuts from cyclic groups, Average shadow price in a mixed integer linear programming problem, On the enumerative nature of Gomory's dual cutting plane method, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Convex analysis in groups and semigroups: a sampler, Some aspects of integer programming duality, Cut search methods in integer programming, A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme, Equilibrium prices supported by dual price functions in markets with non-convexities, Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen, Improved penalty calculations for a mixed integer branch-and-bound algorithm, Stochastic level-value approximation for quadratic integer convex programming, Classical cuts for mixed-integer programming and branch-and-cut, New branch-and-Cut algorithm for bilevel linear programming, Integer programming as projection, Mingling: mixed-integer rounding with bounds, Mixing MIR inequalities with two divisible coefficients, 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, A relax-and-cut framework for Gomory mixed-integer cuts, Branching on general disjunctions, Heuristically aided set-covering algorithms, Efficient market-clearing prices in markets with nonconvexities, A convex-analysis perspective on disjunctive cuts, Split closure and intersection cuts, Discrete right hand side parametrization for linear integer programs, Testing cut generators for mixed-integer linear programming, Critical Review of Pricing Schemes in Markets with Non-Convex Costs, On the safety of Gomory cut generators, Valid inequalities for mips and group polyhedra from approximate liftings, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, Integer programming duality: Price functions and sensitivity analysis, Average shadow price and equilibrium price: a case study of tradable pollution permit markets, Non-linear anonymous pricing combinatorial auctions, 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, Integer-programming software systems
