An evolutionary heuristic for quadratic 0-1 programming
From MaRDI portal
DOI10.1016/S0377-2217(98)00359-2zbMATH Open0938.90051OpenAlexW2086391028MaRDI QIDQ1809845FDOQ1809845
Authors: Andrea Lodi, Kim Allemand, Thomas M. Liebling 
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
Recommendations
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- scientific article; zbMATH DE number 1203238
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- scientific article; zbMATH DE number 1174443
- Greedy and local search heuristics for unconstrained binary quadratic programming
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Quadratic knapsack 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
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Adaptive memory tabu search for binary quadratic programs
- Heuristic methods for large centroid clustering problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- The cut polytope and the Boolean quadric polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Minimum cuts and related problems
- A solvable case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- Testing optimality for quadratic 0-1 problems
- Title not available (Why is that?)
Cited In (33)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- An improved linearization strategy for zero-one quadratic programming problems
- Hybridization of GRASP metaheuristic with data mining techniques
- A variable-grouping based genetic algorithm for large-scale integer programming
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A linearization framework for unconstrained quadratic (0-1) problems
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The unconstrained binary quadratic programming problem: a survey
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- A hybrid data mining metaheuristic for the p‐median problem
- Making a state-of-the-art heuristic faster with data mining
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Min-Max MPC based on a network problem
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Metaheuristic algorithms
- Title not available (Why is that?)
- Path relinking for unconstrained binary quadratic programming
- A hybrid metaheuristic approach to solving the UBQP problem
- A hybrid data mining GRASP with path-relinking
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Title not available (Why is that?)
- New approach to solve unconstrained binary quadratic problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Building an iterative heuristic solver for a quantum annealer
- A new approach for modeling and solving set packing problems
- Linear and quadratic programming approaches for the general graph partitioning problem
- ``Miniaturized linearizations for quadratic 0/1 problems
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Problems of discrete optimization: challenges and main approaches to solve them
Uses Software
This page was built for publication: An evolutionary heuristic for quadratic 0-1 programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809845)
