The ordered median tree location problem
From MaRDI portal
Cites work
- ``Facet separation with one linear program
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A comparison of formulations and solution methods for the minimum-envy location problem
- A flexible model and efficient solution strategies for discrete location problems
- A new formulation and resolution method for the p-center problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- A note on the selection of Benders' cuts
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An explicit solution of a generalized optimum requirement spanning tree problem with a property related to Monge
- An extended covering model for flexible discrete and equity location problems
- An improved Benders decomposition algorithm for the tree of hubs location problem
- An improved Benders decomposition applied to a multi-layer network design problem
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Benders decomposition for the discrete ordered median problem
- Branch-and-cut-and-price for capacitated connected facility location
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
- Distribution systems design with role dependent objectives
- Dual-based local search for the connected facility location and related problems
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Exact procedures for solving the discrete ordered median problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Generalized Benders decomposition
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 1737519 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Locating tree-shaped facilities using the ordered median objective
- MIP models for connected facility location: a theoretical and computational study
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- On spanning tree problems with multiple objectives
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Ordered weighted average combinatorial optimization: formulations and their properties
- Ordered weighted average optimization in multiobjective spanning tree problem
- Partitioning procedures for solving mixed-variables programming problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- Single-allocation ordered median hub location problems
- Solving large p-median problems with a radius formulation
- Solving Steiner trees: Recent advances, challenges, and perspectives
- The Benders decomposition algorithm: a literature review
- The General Steiner Tree-Star problem.
- The ordered capacitated facility location problem
- The Stackelberg minimum spanning tree game
- The tree of hubs location problem
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(2)
This page was built for publication: The ordered median tree location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979405)
