Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
From MaRDI portal
(Redirected from Publication:1062913)
Recommendations
Cites work
- scientific article; zbMATH DE number 3831653 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- An Algorithm for Finding K Minimum Spanning Trees
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
- The travelling salesman problem and a class of polyhedra of diameter two
- Thek best spanning arborescences of a network
- Two Algorithms for Generating Weighted Spanning Trees in Order
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)
