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 | Branch-and-Bound | Branch and Bound |
-
Project scheduling with resource constraints : a branch and bound approach
Christofides, Nicos, (1987)
-
Ozturk, Onur, (2017)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
Reflections about pseudo-dual prices in combinatorial auctions
Drexl, Andreas, (2005)
-
Common Mistakes in Computing the Nucleolus
Guajardo, Mario, (2014)
-
The Coauthorship Network Analysis of the BI Norwegian Business School
Belik, Ivan, (2014)
- More ...