Paroid search: Generic local combinatorial optimization
From MaRDI portal
Publication:1801678
DOI10.1016/0166-218X(93)90005-9zbMath0786.90058MaRDI QIDQ1801678
Ronald L. Rardin, Moises Sudit
Publication date: 5 May 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Cites Work
- How easy is local search?
- Paroids: A canonical format for combinatorial optimization
- Two algorithms for weighted matroid intersection
- Worst case analysis of greedy type algorithms for independence systems
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Analysis of the Greedy Heuristic for Independence Systems
- A Method for Solving Traveling-Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Paroid search: Generic local combinatorial optimization
