On discrete optimization with ordering
From MaRDI portal
Publication:367635
DOI10.1007/s10479-011-1044-7zbMath1272.90030OpenAlexW1980052563WikidataQ58217159 ScholiaQ58217159MaRDI QIDQ367635
Antonio M. Rodríguez-Chía, Justo Puerto, Elena Fernández
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1044-7
Related Items
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions, A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem, A comparative study of different formulations for the capacitated discrete ordered median problem, An exact completely positive programming formulation for the discrete ordered median problem: an extended version, Revisiting \(k\)-sum optimization, Optimal pricing of competing retailers under uncertain demand -- a two layer supply chain model, On the generality of the greedy algorithm for solving matroid base problems, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, On Universal Shortest Paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ordered capacitated facility location problem
- On generalized balanced optimization problems
- Balanced optimization problems
- The \(k\)-centrum shortest path 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
- Two poset polytopes
- On finding most uniform spanning trees
- Minimum deviation problems
- Traveling salesman problem under categorization
- Polyhedral results for the precedence-constrained knapsack problem
- An improved general procedure for lexicographic bottleneck problems
- Minimum dispersion problems
- Improved algorithms for several network location problems with equality measures.
- A note on a new variant of Murty's ranking assignments algorithm
- Robust discrete optimization and network flows
- Lexicographic balanced optimization problems
- The centdian subtree on tree networks
- Locating tree-shaped facilities using the ordered median objective
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Algorithmic results for ordered median problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Constrained matroidal bottleneck problems
- A generalized model of equality measures in network location problems
- Exact procedures for solving the discrete ordered median problem
- Location Theory
- Lexicographic optimisation in generalised network flow problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Algorithms for Voting and Competitive Location on a Network
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Centers to centroids in graphs
- From the median to the generalized center
- Note—A Computational Survey of Methods for the Set Covering Problem
- Robust Positioning of Service Units
- Generalized Bottleneck Problems∗
- Minimizing the Flow-time Variance in Single-machine Systems
- A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment
- Covering Problems: Duality Relations and a New Method of Solution
- Simplification of the Covering Problem with Application to Boolean Expressions
- Finding the K Shortest Loopless Paths in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- On the Set-Covering Problem
- Covering Problems
- The \(k\)-centrum multi-facility location problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
