A new linearization technique for multi-quadratic 0-1 programming problems.
From MaRDI portal
Publication:703274
DOI10.1016/j.orl.2004.03.005zbMath1054.90047OpenAlexW2074522670MaRDI QIDQ703274
Oleg A. Prokopyev, Panos M. Pardalos, Wanpracha Art 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
Related Items
Mathematical Programming Models and Exact Algorithms, A review of recent advances in global optimization, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Electroencephalogram (EEG) time series classification: applications in epilepsy, Robustness and Strong Attack Tolerance of Low-Diameter Networks, Structured linear reformulation of binary quadratically constrained quadratic programs, Fractional 0-1 programming: applications and algorithms, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Integrating combinatorial algorithms into a linear programming solver, Inductive linearization for binary quadratic programs with linear constraints, Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, On zero duality gap in nonconvex quadratic programming problems, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, On linearization techniques for budget-constrained binary quadratic programming problems, Linear and quadratic programming approaches for the general graph partitioning problem, Compact linearization for binary quadratic problems subject to assignment constraints, Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods, Linear forms of nonlinear expressions: new insights on old ideas, An improved linearization strategy for zero-one quadratic programming problems, On the time series support vector machine using dynamic time warping kernel for brain activity classification, Time—Frequency Analysis of Brain Neurodynamics, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, An improved linearization technique for a class of quadratic 0-1 programming problems, Stochastic single-allocation hub location, Perspectives on modeling hub location problems, Linearization of a 0-1 quadratic fractional programming problem, Theoretical and computational study of several linearisation techniques for binary quadratic problems, LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM, Solving multistatic sonar location problems with mixed-integer programming, On the Quadratic Programming Approach for Hub Location Problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry, A hybrid approach for designing a railway transportation network of hazardous material tanks
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Introduction to global optimization
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Methods of Nonlinear 0-1 Programming
- Construction of test problems in quadratic bivalent programming
- 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
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
