Recommendations
Cites work
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 3654139 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the 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
- A generalized model of equality measures in network location problems
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- A note on a new variant of Murty's ranking assignments algorithm
- Algorithmic results for ordered median problems
- Algorithms for Voting and Competitive Location on a Network
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- An improved general procedure for lexicographic bottleneck problems
- Balanced optimization problems
- Centers to centroids in graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constrained matroidal bottleneck problems
- Covering Problems
- Covering Problems: Duality Relations and a New Method of Solution
- Exact procedures for solving the discrete ordered median problem
- Finding the K Shortest Loopless Paths in a Network
- From the median to the generalized center
- Generalized Bottleneck Problems∗
- Improved algorithms for several network location problems with equality measures.
- Lexicographic balanced optimization problems
- Lexicographic optimisation in generalised network flow problems
- Locating tree-shaped facilities using the ordered median objective
- Location theory. A unified approach
- Minimizing the Flow-time Variance in Single-machine Systems
- Minimum deviation problems
- Minimum dispersion problems
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Note—A Computational Survey of Methods for the Set Covering Problem
- On finding most uniform spanning trees
- On generalized balanced optimization problems
- On the Set-Covering Problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Polyhedral results for the precedence-constrained knapsack problem
- Robust Positioning of Service Units
- Robust discrete optimization and network flows
- Simplification of the Covering Problem with Application to Boolean Expressions
- The \(k\)-centrum multi-facility location problem
- The \(k\)-centrum shortest path problem
- The centdian subtree on tree networks
- The ordered capacitated facility location problem
- Traveling salesman problem under categorization
- Two poset polytopes
Cited in
(17)- On the generality of the greedy algorithm for solving matroid base problems
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Problems of order optimization
- On universal shortest paths
- Simple optimization problems via majorization ordering
- Ordered Solutions for Dynamic Programs
- Revisiting \(k\)-sum optimization
- scientific article; zbMATH DE number 671947 (Why is no real title available?)
- Optimal pricing of competing retailers under uncertain demand -- a two layer supply chain model
- About optimization problems with probabilistic uncertainty
- Optimal ordered problem solver
- scientific article; zbMATH DE number 3898639 (Why is no real title available?)
- scientific article; zbMATH DE number 6861975 (Why is no real title available?)
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
This page was built for publication: On discrete optimization with ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367635)
