A new linearization technique for multi-quadratic 0-1 programming problems.
From MaRDI portal
Publication:703274
DOI10.1016/J.ORL.2004.03.005zbMATH Open1054.90047OpenAlexW2074522670MaRDI QIDQ703274FDOQ703274
Authors: Panos M. Pardalos, Oleg A. Prokopyev, Wanpracha A. Chaovalitwongse 
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.03.005
Recommendations
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A linearization framework for unconstrained quadratic (0-1) problems
- ``Miniaturized linearizations for quadratic 0/1 problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
Cites Work
- Title not available (Why is that?)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Introduction to global optimization
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Methods of Nonlinear 0-1 Programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Construction of test problems in quadratic bivalent programming
- Title not available (Why is that?)
Cited In (43)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- An improved linearization strategy for zero-one quadratic programming problems
- Mathematical programming models and exact algorithms
- Linear Reformulations of Integer Quadratic Programs
- Efficient configuration of heterogeneous multistatic sonar networks: a mixed-integer linear programming approach
- Integrating combinatorial algorithms into a linear programming solver
- On zero duality gap in nonconvex quadratic programming problems
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Solving multistatic sonar location problems with mixed-integer programming
- Reducing the number of variables in integer quadratic programming problem
- Electroencephalogram (EEG) time series classification: applications in epilepsy
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Fractional 0-1 programming: applications and algorithms
- A review of recent advances in global optimization
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
- Linearization of a 0-1 quadratic fractional programming problem
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- An improved linearization technique for a class of quadratic 0-1 programming problems
- Reduction of indefinite quadratic programs to bilinear programs
- A hybrid approach for designing a railway transportation network of hazardous material tanks
- Stochastic single-allocation hub location
- A linearization technique for quadratic integer programming with box constraint
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Robustness and strong attack tolerance of low-diameter networks
- Compact linearization for binary quadratic problems subject to assignment constraints
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- On the Quadratic Programming Approach for Hub Location Problems
- Time—Frequency Analysis of Brain Neurodynamics
- Linear forms of nonlinear expressions: new insights on old ideas
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
- Inductive linearization for binary quadratic programs with linear constraints
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Linear and quadratic programming approaches for the general graph partitioning problem
- On linearization techniques for budget-constrained binary quadratic programming problems
- Perspectives on modeling hub location problems
- On the time series support vector machine using dynamic time warping kernel for brain activity classification
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
This page was built for publication: A new linearization technique for multi-quadratic 0-1 programming problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703274)
