Heuristically aided set-covering algorithms
From MaRDI portal
Cites work
- An Improved Implicit Enumeration Approach for Integer Programming
- Computer Solutions of the Traveling Salesman Problem
- Computer Solutions to Minimum-Cover Problems
- scientific article; zbMATH DE number 3155211 (Why is no real title available?)
- scientific article; zbMATH DE number 3305071 (Why is no real title available?)
- Integer Programming and Pricing
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
Cited in
(1)
This page was built for publication: Heuristically aided set-covering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401517)