A bi-objective approach to discrete cost-bottleneck location problems

DOI10.1007/s10479-016-2360-8zbMath1398.90154OpenAlexW2551080295MaRDI QIDQ1615950

Andreas Klose, Lars Relund Nielsen, Sune Lauth Gadegaard

Publication date: 31 October 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://pure.au.dk/ws/files/165164872/Gadegaard_2018_A_bi_objective_approach_to_discrete_cost_bottleneck_location.pdf

zbMATH Keywords

bi-objective optimization\(\varepsilon\)-constrained methodlexicographic optimizationdiscrete facility location

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (6)

A bi-objective approach to discrete cost-bottleneck location problems ⋮ Finding shortest and dissimilar paths ⋮ Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach ⋮ An exact and a heuristic approach for the transportation-\(p\)-facility location problem ⋮ BOCBLP ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• A branch-and-price algorithm for the capacitated facility location problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Multiple criteria facility location problems: a survey
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• An algorithm for the bi-criterion integer programming problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• A multicriteria approach to the location of public facilities
• Multicriteria planar location problems
• Application of facility location modeling constructs to vendor selection problems
• A bi-objective approach to discrete cost-bottleneck location problems
• Multiobjective solution of the uncapacitated plant location problem
• Multiple criteria decision analysis. State of the art surveys
• Branching rules revisited
• An improved algorithm for solving biobjective integer programs
• A bibliography for some fundamental problem categories in discrete location science
• Finding representative systems for discrete bicriterion optimization problems
• Solution methods for thep-median problem: An annotated bibliography
• A Capacitated Bottleneck Facility Location Problem
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Multicriteria network location problems with sum objectives
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Multicriteria Optimization
• Integer Programming: Methods, Uses, Computations
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Time‐minimizing transportation problems
• The bottleneck transportation problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: A bi-objective approach to discrete cost-bottleneck location problems