×

Found 56 Documents (Results 1–56)

An adaptive neighborhood search for \(k\)-clustering minimum bi-clique completion problems. (English) Zbl 1370.90218

Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Proceedings of the 3rd international conference on modelling, computation and optimization in information systems and management sciences, MCO 2015, Lorraine, France, May 11–13, 2015. Part I. Cham: Springer (ISBN 978-3-319-18160-8/pbk; 978-3-319-18161-5/ebook). Advances in Intelligent Systems and Computing 359, 15-25 (2015).
MSC:  90C27 90C35 90C59
PDFBibTeX XMLCite
Full Text: DOI

A fast large neighborhood search for disjunctively constrained knapsack problems. (English) Zbl 1452.90268

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, 396-407 (2014).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

A linear programming approach for the three-dimensional bin-packing problem. (English) Zbl 1274.90315

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 993-1000 (2010).
MSC:  90C27 90C05 90C11
PDFBibTeX XMLCite
Full Text: Link

Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study. (English) Zbl 1237.90195

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 439-446 (2010).
MSC:  90C27 90C31
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software