×

Found 24 Documents (Results 1–24)

Approximability of two variants of multiple knapsack problems. (English) Zbl 1459.68232

Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9079, 365-376 (2015).
PDFBibTeX XMLCite
Full Text: DOI Link

Coupled-tasks in presence of bipartite compatibilities graphs. (English) Zbl 1451.90057

Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 161-172 (2014).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI HAL

A survey on approximation algorithms for scheduling with machine unavailability. (English) Zbl 1248.68112

Lerner, Jürgen (ed.) et al., Algorithmics of large and complex networks. Design, analysis, and simulation. Berlin: Springer (ISBN 978-3-642-02093-3/pbk). Lecture Notes in Computer Science 5515, 50-64 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software