scientific article; zbMATH DE number 1823835

zbMATH Open0999.90030MaRDI QIDQ3153223FDOQ3153223

Dušan Tošić, Jozef Kratica, Ivana Ljubić, V. Filipovic

Publication date: 5 November 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

customerdual based algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the exact solution of large-scale simple plant location problems 👍 👎
• A comparison of heuristics and relaxations for the capacitated plant location problem 👍 👎
• A Lagrangean dual ascent algorithm for simple plant location problems 👍 👎
• Fast bounding procedures for large instances of the simple plant location problem 👍 👎
• Branch and peg algorithms for the simple plant location problem 👍 👎
• New variants of the simple plant location problem and applications 👍 👎
• A separation algorithm for the simple plant location problem 👍 👎
• Approximation Algorithms for Generalized Plant Location 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3153223)