Two-best solutions under distance constraints: The model and exemplary results for matroids

DOI10.1006/AAMA.1998.0618zbMATH Open0922.05016OpenAlexW2264379643MaRDI QIDQ1291060FDOQ1291060

Authors: Ingo Althöfer, Walter Wenzel 

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

Recommendations

• \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
• k-Best constrained bases of a matroid
• On the \(K\)th best base of a matroid
• A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids

zbMATH Keywords

distance functionvaluated matroidsorientable matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Finding the k Shortest Paths
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Minimal-energy clusters of hard spheres
• Title not available (Why is that?)
• Finding the \(k\) quickest simple paths in a network
• A Method for the Solution of the N th Best Path Problem
• An Algorithm for Finding K Minimum Spanning Trees
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• Valuated matroids
• Valuated matroids: A new look at the greedy algorithm
• Title not available (Why is that?)
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated Matroid Intersection II: Algorithms
• Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
• Penny-packing and two-dimensional codes
• Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
• Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• Onkth Best Policies
• k-optimal solution sets for some polynomially solvable scheduling problems

Cited In (5)

• k-Best constrained bases of a matroid
• On the \(K\)th best base of a matroid
• \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
• A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids
• On circuit valuation of matroids

This page was built for publication: Two-best solutions under distance constraints: The model and exemplary results for matroids

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