An evolutionary heuristic for quadratic 0-1 programming
From MaRDI portal
Publication:1809845
DOI10.1016/S0377-2217(98)00359-2zbMath0938.90051OpenAlexW2086391028MaRDI QIDQ1809845
Andrea Lodi, Thomas M. Liebling, Kim Allemand
Publication date: 27 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00359-2
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Problems of discrete optimization: challenges and main approaches to solve them, Metaheuristic Algorithms, Building an iterative heuristic solver for a quantum annealer, Making a state-of-the-art heuristic faster with data mining, Probabilistic GRASP-tabu search algorithms for the UBQP problem, A hybrid data mining GRASP with path-relinking, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, The unconstrained binary quadratic programming problem: a survey, Linear and quadratic programming approaches for the general graph partitioning problem, Solving unconstrained binary quadratic programming problem by global equilibrium search, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, An improved linearization strategy for zero-one quadratic programming problems, A new approach for modeling and solving set packing problems, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Min-Max MPC based on a network problem, Path relinking for unconstrained binary quadratic programming, Using \(xQx\) to model and solve the uncapacitated task allocation problem, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, An effective branch-and-bound algorithm for convex quadratic integer programming, Hybridization of GRASP metaheuristic with data mining techniques, A variable-grouping based genetic algorithm for large-scale integer programming, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, A hybrid data mining metaheuristic for the p‐median problem, A linearization framework for unconstrained quadratic (0-1) problems, One-pass heuristics for large-scale unconstrained binary quadratic problems, An unconstrained quadratic binary programming approach to the vertex coloring problem, ``Miniaturized linearizations for quadratic 0/1 problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A solvable case of quadratic 0-1 programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- Testing optimality for quadratic 0-1 problems
- Heuristic methods for large centroid clustering problems
- The cut polytope and the Boolean quadric polytope
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- Minimum cuts and related problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- On the cut polytope
- A Decomposition Method for Quadratic Zero-One Programming
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
