QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
From MaRDI portal
Publication:1278400
DOI10.1016/0377-2217(95)00298-7zbMath0947.90611OpenAlexW2093742773WikidataQ114683542 ScholiaQ114683542MaRDI QIDQ1278400
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00298-7
Related Items (2)
Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ QUAD01
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- A solvable class of quadratic 0-1 programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
- Solving Large-Scale Zero-One Linear Programming Problems
- Methods of Nonlinear 0-1 Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm