Integrating combinatorial algorithms into a linear programming solver
From MaRDI portal
Publication:2418164
DOI10.1007/s10100-018-0552-9OpenAlexW2803920028MaRDI QIDQ2418164
Anita Varga, Richárd Molnár-Szipai
Publication date: 3 June 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-018-0552-9
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new linearization technique for multi-quadratic 0-1 programming problems.
- To lay out or not to lay out?
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- QAPLIB - a quadratic assignment problem library
- Solving large quadratic assignment problems in parallel
- The Quadratic Assignment Problem
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- P-Complete Approximation Problems
This page was built for publication: Integrating combinatorial algorithms into a linear programming solver