Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
From MaRDI portal
Publication:5181541
DOI10.1287/opre.22.1.180zbMath0272.90049OpenAlexW2008389133WikidataQ60395655 ScholiaQ60395655MaRDI QIDQ5181541
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.1.180
Related Items
The Boolean Quadric Polytope, Mathematical Programming Models and Exact Algorithms, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, Advanced network connectivity features and zonal requirements in covering location problems, Solving multiplicative programs by binary-encoding the multiplication operation, Inductive linearization for binary quadratic programs with linear constraints, An exact cutting plane method for the Euclidean max-sum diversity problem, Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation, On the strength of recursive McCormick relaxations for binary polynomial optimization, Shortest paths with exclusive-disjunction arc pairs conflicts, Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, Health service network design: a robust possibilistic approach, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Closed loop supply chain mathematical modeling considering lean agile resilient and green strategies, Heuristic algorithms for the maximum diversity problem, An order release mechanism for a flexible flow system, Models and solution approaches for part movement minimization and load balancing in FMS with machine, tool and process plan flexibilities, A revised Taha's algorithm for polynomial 0-1 programming, The Multistatic Sonar Location Problem and Mixed-Integer Programming, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Decision Diagram Decomposition for Quadratically Constrained Binary Optimization, Mixed-integer quadratic programming, A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization, Recourse problem of the 2-stage robust location transportation problem, A global approach for general \(0-1\) fractional programming, Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes, Graph, clique and facet of Boolean logical polytope, A branch and bound algorithm for solving separable convex integer programming problems, A branch and bound algorithm for the maximum diversity problem, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, An introduction to stochastic bin packing-based server consolidation with conflicts, Lower bounding procedure for the asymmetric quadratic traveling salesman problem, Matroid optimisation problems with nested non-linear monomials in the objective function, A class of algorithms for mixed-integer bilevel min-max optimization, An algorithm for indefinite integer quadratic programming, Integer programming models and linearizations for the traveling car renter problem, A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization, A discrete optimization model for preserving biological diversity, Discrete dynamical system approaches for Boolean polynomial optimization, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization, Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering, Structured linear reformulation of binary quadratically constrained quadratic programs, Strong valid inequalities for Boolean logical pattern generation, Fractional 0-1 programming: applications and algorithms, Nonlinear 0–1 programming: I. Linearization techniques, Specialized inspection problems in serial production systems, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, A cut-and-branch algorithm for the quadratic knapsack problem, The bipartite Boolean quadric polytope, A polyhedral study of lifted multicuts, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, An outer-approximation approach for information-maximizing sensor selection, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, Minimal arc-sets spanning dicycles, On linearization techniques for budget-constrained binary quadratic programming problems, Modeling and integer programming techniques applied to propositional calculus, Mixed integer programming for the 0--1 maximum probability model., Compact linearization for binary quadratic problems subject to assignment constraints, A note on linearized reformulations for a class of bilevel linear integer problems, Reduction of nonlinear integer separable programming problems∗, Extending the QCR method to general mixed-integer programs, Linear forms of nonlinear expressions: new insights on old ideas, \(t\)-linearization for the maximum diversity problem, An improved linearization strategy for zero-one quadratic programming problems, Valid inequalities for quadratic optimisation with domain constraints, Robust location transportation problems under uncertain demands, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Solving a class of feature selection problems via fractional 0--1 programming, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Berge-acyclic multilinear 0-1 optimization problems, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, A class of valid inequalities for multilinear 0-1 optimization problems, Mixed-integer bilinear programming problems, An approximate method for local optima for nonlinear mixed integer programming problems, Models and linearizations for the Traveling Car Renter with passengers, Concave extensions for nonlinear 0-1 maximization problems, An improved linearization technique for a class of quadratic 0-1 programming problems, Algebraic formulation of circuit design problems, The min-conflict packing problem, A new formulation of operation allocation problem in flexible manufacturing systems: mathematical modelling and computational experience, RLT insights into lift-and-project closures, A computational study on the quadratic knapsack problem with multiple constraints, Pseudo-Boolean optimization, A new linearization technique for multi-quadratic 0-1 programming problems., A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, Unconstrained 0-1 optimization and Lagrangean relaxation, The indefinite zero-one quadratic problem, Integer programming formulation of combinatorial optimization problems, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation, Compact integer-programming models for extracting subsets of stimuli from confusion matrices, Theoretical and computational study of several linearisation techniques for binary quadratic problems, The vehicle routing problem with simultaneous pickup and delivery and handling costs, Mixed Integer Linear Programming Formulation Techniques, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, Tightening concise linear reformulations of 0-1 cubic programs, Solving multistatic sonar location problems with mixed-integer programming, Lagrangean decompositions for the unconstrained binary quadratic programming problem, A decision model for interdependent information system project selection, On the Quadratic Programming Approach for Hub Location Problems, Convex hull representations of special monomials of binary variables, A linearization framework for unconstrained quadratic (0-1) problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Matroid optimization problems with monotone monomials in the objective, QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm, Combinatorial optimization models for production scheduling in automated manufacturing systems, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, An efficient linearization approach for mixed-integer problems, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, A constrained nonlinear 0-1 program for data allocation, A linearization method for mixed 0--1 polynomial programs, An alternative efficient representation for the project portfolio selection problem, A dynamic production planning and scheduling algorithm for two products processed on one line, Polyhedra related to integer-convex polynomial systems, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, A new global approach for \(0\)-\(1\) polynomial programs, Configuration of manufacturing software through capability specification and selection, Univariate parameterization for global optimization of mixed-integer polynomial problems, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
