Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions

DOI10.1016/S0166-218X(85)80004-4zbMath0573.90070MaRDI QIDQ1062913

Ulrich Derigs

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationgradientadjacencygreedy methodexchange propertiesk-best solutions

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (2)

Matching problems with generalized upper bound side constraints ⋮ Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
• Thek best spanning arborescences of a network
• An Algorithm for Finding K Minimum Spanning Trees
• The travelling salesman problem and a class of polyhedra of diameter two
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
• 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: Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions