Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
From MaRDI portal
Publication:1062913
DOI10.1016/S0166-218X(85)80004-4zbMATH Open0573.90070MaRDI QIDQ1062913FDOQ1062913
Authors: Ulrich Derigs 
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Title not available (Why is that?)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- An Algorithm for Finding K Minimum Spanning Trees
- Two Algorithms for Generating Weighted Spanning Trees in Order
- The travelling salesman problem and a class of polyhedra of diameter two
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
- Title not available (Why is that?)
- Thek best spanning arborescences of a network
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
Cited In (3)
This page was built for publication: Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062913)
