A new linearization technique for multi-quadratic 0-1 programming problems.
From MaRDI portal
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
- scientific article; zbMATH DE number 2091783 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Construction of test problems in quadratic bivalent programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Graph separation techniques for quadratic zero-one programming
- Introduction to global optimization
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Methods of Nonlinear 0-1 Programming
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- 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
(43)- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Reduction of indefinite quadratic programs to bilinear programs
- Integrating combinatorial algorithms into a linear programming solver
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- A hybrid approach for designing a railway transportation network of hazardous material tanks
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- Robustness and strong attack tolerance of low-diameter networks
- Stochastic single-allocation hub location
- Linearization of a 0-1 quadratic fractional programming problem
- Solving multistatic sonar location problems with mixed-integer programming
- A review of recent advances in global optimization
- Perspectives on modeling hub location problems
- A linearization technique for quadratic integer programming with box constraint
- 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
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
- On the Quadratic Programming Approach for Hub Location Problems
- Time—Frequency Analysis of Brain Neurodynamics
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
- On zero duality gap in nonconvex quadratic programming problems
- Fractional 0-1 programming: applications and algorithms
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Linear forms of nonlinear expressions: new insights on old ideas
- Mathematical programming models and exact algorithms
- Linear and quadratic programming approaches for the general graph partitioning problem
- On linearization techniques for budget-constrained binary quadratic programming problems
- Linear Reformulations of Integer Quadratic Programs
- Compact linearization for binary quadratic problems subject to assignment constraints
- Reducing the number of variables in integer quadratic programming problem
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Efficient configuration of heterogeneous multistatic sonar networks: a mixed-integer linear programming approach
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Electroencephalogram (EEG) time series classification: applications in epilepsy
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Inductive linearization for binary quadratic programs with linear constraints
- An improved linearization technique for a class of quadratic 0-1 programming problems
- An improved linearization strategy for zero-one quadratic programming 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)
