k-Best constrained bases of a matroid

DOI10.1007/BF01415971zbMath0694.90081OpenAlexW2040900039MaRDI QIDQ3470256

No author found.

Publication date: 1990

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415971

zbMATH Keywords

rankingmatroidk-best bases

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Color constrained combinatorial optimization problems

Cites Work

• Unnamed Item
• Ranking scalar products to improve bounds for the quadratic assignment problem
• Algorithms for finding k-best perfect matchings
• A multiply constrained matroid optimization problem
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: k-Best constrained bases of a matroid