An interactive procedure dedicated to a bicriteria plant location model.

DOI10.1016/S0305-0548(02)00120-XzbMath1047.90030OpenAlexW2112359231WikidataQ59682392 ScholiaQ59682392MaRDI QIDQ1413829

M. Eugénia, Joana Dias, Joao Carlos Namorado Climaco

Publication date: 17 November 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00120-x

zbMATH Keywords

Interactive procedureBicriteria modelPlant location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Related Items (2)

A memetic algorithm for multi-objective dynamic location problems ⋮ [NO TITLE AVAILABLE]

Uses Software

• CPLEX

Cites Work

• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• On the exact solution of large-scale simple plant location problems
• A multicriteria approach to the location of public facilities
• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• The Plant Location Problem: New Models and Research Prospects
• Unnamed Item
• Unnamed Item

This page was built for publication: An interactive procedure dedicated to a bicriteria plant location model.