A multi-objective perspective on the cable-trench problem

DOI10.1007/S10878-025-01289-0MaRDI QIDQ6991806zbMATH OpenFDO

Authors Lara Löhken, Michael Stiglmayr

Publication date 28 April 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10878-025-01289-0

zbMATH Keywords

combinatorial optimizationminimum spanning treemulti-objective optimizationnetwork flow problemshortest paths

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Cites work

• A Benders decomposition based framework for solving cable trench problems
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
• A note on two problems in connexion with graphs
• A survey and annotated bibliography of multiobjective combinatorial optimization
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem
• Augmenting bi-objective branch and bound by scalarization-based information
• Balancing minimum spanning trees and shortest-path trees
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• Bicriteria Transportation Problem
• Branch-and-bound for bi-objective integer programming
• Combinatorial optimization. Theory and algorithms
• scientific article; zbMATH DE number 5917374 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1784662 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
• Modeling the capacitated \(p\)-cable trench problem with facility costs
• Multicriteria Optimization
• Multiobjective programming and planning
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• On some multicriteria arborescence problems: Complexity and algorithms
• On the complexity of the cable-trench problem
• On the inapproximability of the cable-trench problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The cable trench problem: Combining the shortest path and minimum spanning tree problems
• The complexity of the network design problem
• The generalized Steiner cable-trench problem with application to error correction in vascular image analysis
• Über ein Minimalproblem.

This page was built for publication: A multi-objective perspective on the cable-trench problem

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