Two-best solutions under distance constraints: The model and exemplary results for matroids
From MaRDI portal
Publication:1291060
DOI10.1006/aama.1998.0618zbMath0922.05016OpenAlexW2264379643MaRDI QIDQ1291060
Publication date: 11 October 1999
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1998.0618
Related Items (2)
On circuit valuation of matroids ⋮ \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Valuated matroids: A new look at the greedy algorithm
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- k-optimal solution sets for some polynomially solvable scheduling problems
- Valuated matroids
- Geometric algorithms and combinatorial optimization
- Penny-packing and two-dimensional codes
- Finding the \(k\) quickest simple paths in a network
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
- Minimal-energy clusters of hard spheres
- Onkth Best Policies
- A Method for the Solution of the N th Best Path Problem
- Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
- Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
- An Algorithm for Finding K Minimum Spanning Trees
- Finding the k Shortest Paths
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
This page was built for publication: Two-best solutions under distance constraints: The model and exemplary results for matroids
