A trust branching path heuristic for permutation problems

MaRDI QIDQ3656067zbMATH OpenFDO

Authors Dominique Fortin, Ider Tseveendorj

Publication date 13 January 2010

zbMATH Keywords

QAPTSP

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• scientific article; zbMATH DE number 2049005
• A trust branching path heuristic for zero-one programming
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• Transportation problems on permutations: properties of estimates in the branch and bound method

Cited in

(5)

• A trust branching path heuristic for zero-one programming
• Transportation problems on permutations: properties of estimates in the branch and bound method
• Context-independent scatter and tabu search for permutation problems
• Survey of piecewise convex maximization and PCMP over spherical sets
• Detecting and exploiting permutation structures in MIPs

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: A trust branching path heuristic for permutation problems

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