Paroid search: Generic local combinatorial optimization

DOI10.1016/0166-218X(93)90005-9MaRDI QIDQ1801678zbMATH OpenFDO

Authors Ronald L. Rardin, Moises Sudit

Publication date 5 May 1994

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

zbMATH Keywords

combinatorial heuristicslocal combinatorial optimizationparoid struture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Paroids: A canonical format for combinatorial optimization
• Local search heuristics for combinatorial optimization problems
• Parallel local search
• A local search template.
• scientific article; zbMATH DE number 1082099

Cites work

• A method for solving traveling-salesman problems
• An Analysis of the Greedy Heuristic for Independence Systems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• 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

Cited in

(2)

• Paroids: A canonical format for combinatorial optimization
• Metaheuristics: A bibliography

This page was built for publication: Paroid search: Generic local combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801678)