``Miniaturized linearizations for quadratic 0/1 problems
From MaRDI portal
Publication:817208
DOI10.1007/s10479-005-3973-5zbMath1091.90043OpenAlexW2027916958MaRDI QIDQ817208
Serigne Gueye, Philippe Yves Paul Michelon
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3973-5
Related Items
Dantzig-Wolfe reformulations for binary quadratic problems, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, A filled function method for quadratic programs with binary constraints†, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, A linearization framework for unconstrained quadratic (0-1) problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Minimization of a quadratic pseudo-Boolean function
- A linearization method for mixed 0--1 polynomial programs
- An evolutionary heuristic for quadratic 0-1 programming
- The cut polytope and the Boolean quadric polytope
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Unconstrained 0-1 optimization and Lagrangean relaxation
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Nonlinear 0–1 programming: I. Linearization techniques
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- L’algebre de Boole et ses applications en recherche operationnelle
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- A Decomposition Method for Quadratic Zero-One Programming
