A new Lagrangian relaxation approach to the generalized assignment problem
Year of publication: |
1986
|
---|---|
Authors: | Jörnsten, Kurt ; Näsberg, Mikael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 27.1986, 3, p. 313-323
|
Subject: | Programmanalyse ganzzahlig | Programmanalyse nichtlinear | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Project scheduling with resource constraints : a branch and bound approach
Christofides, Nicos, (1987)
-
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
Palleta, Giuseppe, (1987)
-
Parametric-objective integer programming using knapsack facets and Gomory cutting planes
Jenkins, Larry, (1987)
- More ...
-
Reflections about pseudo-dual prices in combinatorial auctions
Drexl, Andreas, (2005)
-
Non-linear anonymous pricing combinatorial auctions
Drexl, Andreas, (2009)
-
Modeling freight markets for coal
Ubøe, Jan, (2009)
- More ...