The following pages link to (Q3270229):
Displaying 50 items.
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- A decision model for interdependent information system project selection (Q1266704) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← 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)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← 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)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- The trunk in the topology of electrical networks (Q2523701) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- The Multistatic Sonar Location Problem and Mixed-Integer Programming (Q4685800) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)
