Pages that link to "Item:Q5181541"
From MaRDI portal
The following pages link to Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program (Q5181541):
Displaying 50 items.
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes (Q1876186) (← links)
- A discrete optimization model for preserving biological diversity (Q1909481) (← links)
- An outer-approximation approach for information-maximizing sensor selection (Q1947624) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Models and linearizations for the Traveling Car Renter with passengers (Q1996740) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Unconstrained 0-1 optimization and Lagrangean relaxation (Q2277361) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- A branch and bound algorithm for the maximum diversity problem (Q2379521) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices (Q2511847) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
- Recourse problem of the 2-stage robust location transportation problem (Q2883563) (← links)
- A new formulation of operation allocation problem in flexible manufacturing systems: mathematical modelling and computational experience (Q3030561) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
- Algebraic formulation of circuit design problems (Q3328470) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Health service network design: a robust possibilistic approach (Q4608268) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
