An improved linearization strategy for zero-one quadratic programming problems
From MaRDI portal
Recommendations
- An improved linearization technique for a class of quadratic 0-1 programming problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Decomposition and linearization for 0-1 quadratic programming
- A linearization framework for unconstrained quadratic (0-1) problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- scientific article; zbMATH DE number 1500161
- A Decomposition Method for Quadratic Zero-One Programming
- A continuous approch for globally solving linearly constrained quadratic
Cites work
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A quadratic integer program for the location of interacting hub facilities
- A survey for the quadratic assignment problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An evolutionary heuristic for quadratic 0-1 programming
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Configuring cellular manufacturing systems: a quadratic integer programming formulation and a simple interchange heuristic
- Designing satellite communication networks by zero—one quadratic programming
- Dynamical approaches and multi-quadratic integer programming for seizure prediction
- Exact Solution of the Quadratic Knapsack Problem
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Global optimization techniques for solving the general quadratic integer programming problem
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- On ``A quadratic integer program for the location of interacting hub facilities
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(30)- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- On linearization techniques for budget-constrained binary quadratic programming problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- A note on linearized reformulations for a class of bilevel linear integer problems
- An enhanced logarithmic method for signomial programming with discrete variables
- Linear and quadratic programming approaches for the general graph partitioning problem
- Stochastic single-allocation hub location
- Perspectives on modeling hub location problems
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Stochastic graph partitioning: quadratic versus SOCP formulations
- On the Quadratic Programming Approach for Hub Location Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Linearization strategy for Boolean least squares problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Inductive linearization for binary quadratic programs with linear constraints
- Shortest paths with exclusive-disjunction arc pairs conflicts
- An improved linearization technique for a class of quadratic 0-1 programming problems
- Large margin shortest path routing
- On the benefits of a new continuous reformulation for QUBO problems
- A continuous nonlinear optimization perspective on the spin glass problem
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- ``Miniaturized linearizations for quadratic 0/1 problems
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
This page was built for publication: An improved linearization strategy for zero-one quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458902)
