scientific article; zbMATH DE number 1823835

MaRDI QIDQ3153223zbMATH OpenFDO

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

Publication date 5 November 2002

zbMATH Keywords

customerdual based algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1848396
• A separation algorithm for the simple plant location problem
• Branch and peg algorithms for the simple plant location problem
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 4010185
• New variants of the simple plant location problem and applications
• Fast bounding procedures for large instances of the simple plant location problem
• A Lagrangean dual ascent algorithm for simple plant location problems
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Approximation Algorithms for Generalized Plant Location

Cited in

(3)

• scientific article; zbMATH DE number 1848396 (Why is no real title available?)
• scientific article; zbMATH DE number 4029232 (Why is no real title available?)
• Solving the simple plant location problem by genetic algorithm

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)