×

Found 62 Documents (Results 1–62)

A computational study of the pseudo-Boolean approach to the \(p\)-median problem applied to cell formation. (English) Zbl 1346.90494

Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 503-516 (2011).
MSC:  90B80 90-08 90C35
PDFBibTeX XMLCite
Full Text: DOI

MIP modeling of incremental connected facility location. (English) Zbl 1346.90478

Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 490-502 (2011).
MSC:  90B80 90C35
PDFBibTeX XMLCite
Full Text: DOI

Constraint-based local search for constrained optimum paths problems. (English) Zbl 1285.68160

Lodi, Andrea (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14–18, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). Lecture Notes in Computer Science 6140, 267-281 (2010).
MSC:  68T20 90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Greedy randomized adaptive search procedures for the Steiner problem in graphs. (English) Zbl 0912.68154

Pardalos, Panos (ed.) et al., Randomization methods in algorithm design. DIMACS workshop, Princeton Univ., NJ, USA, December 12–14, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 43, 133-145 (1999).
PDFBibTeX XMLCite

A chunking based genetic algorithm for the Steiner tree problem in graphs. (English) Zbl 0902.90163

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 335-355 (1998).
PDFBibTeX XMLCite

An exact branch and bound algorithm for the Steiner problem in graphs. (English) Zbl 1527.68162

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 582-590 (1995).
MSC:  68R10 05C85 90C35
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software