Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives

DOI10.1016/S0377-2217(03)00124-3zbMath1056.90017OpenAlexW1992306952MaRDI QIDQ1877893

Anders J. V. Skriver, Kaj Holmberg, Kim Allan Andersen

Publication date: 19 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00124-3

zbMATH Keywords

Facility locationMCDMNetworksMOCOBiobjective optimization

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (2)

The multicriteria \(p\)-facility median location problem on networks ⋮ Multiple criteria facility location problems: a survey

Cites Work

• Zero-one programming with multiple criteria
• Multiobjective programming and planning
• Approximating the noninferior set in multiobjective linear programming problems
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• Multicriteria optimization
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
• Solving zero-one multiple objective programs through implicit enumeration
• A label correcting approach for solving bicriterion shortest-path problems
• An Algorithm for Multiobjective Zero-One Linear Programming
• Multicriteria network location problems with sum objectives
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives