A simple recipe for concise mixed 0-1 linearizations
From MaRDI portal
Publication:1886797
DOI10.1016/j.orl.2004.05.001zbMath1076.90030OpenAlexW2035061152WikidataQ60395653 ScholiaQ60395653MaRDI QIDQ1886797
Warren P. Adams, Richard J. Forrester
Publication date: 19 November 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.05.001
Related Items
Mathematical Programming Models and Exact Algorithms, The Bipartite QUBO, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY, Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering, Structured linear reformulation of binary quadratically constrained quadratic programs, Performance safety enforcement in stochastic event graphs against boost and slow attacks, Fractional 0-1 programming: applications and algorithms, Wildfire fuel management: network-based models and optimization of prescribed burning, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, On Bilevel Optimization with Inexact Follower, Linear forms of nonlinear expressions: new insights on old ideas, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, An improved linearization technique for a class of quadratic 0-1 programming problems, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function, Mixed Integer Linear Programming Formulation Techniques, Tightening concise linear reformulations of 0-1 cubic programs, Solving multistatic sonar location problems with mixed-integer programming, On the Quadratic Programming Approach for Hub Location Problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, An alternative efficient representation for the project portfolio selection problem, Finding optimal solutions to several gray pattern instances
Cites Work
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
