Representations of quadratic combinatorial optimization problems : a case study using quadratic set covering and quadratic knapsack problems
Year of publication: |
2019
|
---|---|
Authors: | Punnen, Abraham P. ; Pandey, Pooja ; Friesen, Michael |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 112.2019, p. 1-19
|
Subject: | 0-1 Quadratic programming | Experimental analysis of algorithms | Set covering problem | Equivalent formulations | Combinatorial optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
-
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio, (2017)
-
Silva, Allyson, (2021)
- More ...
-
A simplex algorithm for piecewise-linear fractional programming problems
Pandey, Pooja, (2007)
-
A simplex algorithm for piecewise-linear fractional programming problems
Pandey, Pooja, (2007)
-
A simplex algorithm for network flow problems with piecewise linear fractional objective function
Pandey, Pooja, (2009)
- More ...