Paroids: A canonical format for combinatorial optimization

DOI10.1016/0166-218X(92)90113-OzbMath0771.05027WikidataQ127517389 ScholiaQ127517389MaRDI QIDQ1199464

Ronald L. Rardin, Moises Sudit

Publication date: 16 January 1993

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

zbMATH Keywords

matchingpackingbasessearch algorithmmatroidtravelling salesmanindependent setsminorsknapsackparoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Paroid search: Generic local combinatorial optimization ⋮ Valid inequalities, cutting planes and integrality of the knapsack polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristically guided algorithm for k-parity matroid problems
• How easy is local search?
• Paroid search: Generic local combinatorial optimization
• Two algorithms for weighted matroid intersection
• Worst case analysis of greedy type algorithms for independence systems
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• Matroid intersection algorithms
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Traveling-Salesman Problem and Minimum Spanning Trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Paroids: A canonical format for combinatorial optimization