Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
From MaRDI portal
Publication:2770136
DOI10.1287/opre.46.3.396zbMath0979.90090OpenAlexW2007520715MaRDI QIDQ2770136
Patrick J. Driscoll, Hanif D. Sherali, Warren P. Adams
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.3.396
linear programming relaxationreformulation-linearization techniqueconvex hull representationhierarchy of relatationslinear mixed integer \(0-1\) problemsspectrum of continuous relaxations
Related Items
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, A review of recent advances in global optimization, Optimization models for a single-plant district cooling system, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A two-level location-allocation problem in designing local access fiber optic networks, Two-stage stochastic hierarchical multiple risk problems: Models and algorithms, A multi-commodity flow formulation for the generalized pooling problem, Strong formulations for the pooling problem, Alternative formulations for the set packing problem and their application to the winner determination problem, Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics, Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem, Global optimization of bilinear programs with a multiparametric disaggregation technique, Exact interdiction models and algorithms for disconnecting networks via node deletions, A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem, Discrete equal-capacityp-median problem, The coastal seaspace patrol sector design and allocation problem, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Tight lower bounds for the traveling salesman problem with draft limits, Robust multicriteria risk-averse stochastic programming models, A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions, Foundation-penalty cuts for mixed-integer programs., A review of deterministic optimization methods in engineering and management, Linear forms of nonlinear expressions: new insights on old ideas, Rank bounds for a hierarchy of Lovász and Schrijver, Convex hull representation of the deterministic bipartite network interdiction problem, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, RLT: A unified approach for discrete and continuous nonconvex optimization, RLT insights into lift-and-project closures, A bilevel fixed charge location model for facilities under imminent attack, A polyhedral study of the generalized vertex packing problem, On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Interleaving two-phased jobs on a single machine, Convex hull representations of special monomials of binary variables, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, An effective linear approximation method for separable programming problems, An efficient linearization approach for mixed-integer problems, A linearization method for mixed 0--1 polynomial programs, The impact of distribution system characteristics on computational tractability, New modeling approaches for the design of local access transport area networks, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, A conditional logic approach for strengthening mixed 0-1 linear programs, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
