A variable depth search branching

DOI10.1016/J.ORL.2012.03.003zbMATH Open1247.90204OpenAlexW2046701582MaRDI QIDQ453047FDOQ453047

José Eduardo jun. Pécora, Vincent Charles, Fabien Cornillier

Publication date: 18 September 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://zenodo.org/record/811462

zbMATH Keywords

heuristicmixed integer programminglocal branchingvariable depth search

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Cites Work

• Algorithms for Radio Link Frequency Assignment: The Calma Project
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Method for Solving Traveling-Salesman Problems
• Local branching
• Local search algorithms for the radio link frequency assignment problem
• Guided local search with shifting bottleneck for job shop scheduling
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Algorithms for Large-scale Travelling Salesman Problems
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem

Uses Software

• CALMA
• MIPLIB

This page was built for publication: A variable depth search branching

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