A variable depth search branching
From MaRDI portal
Recommendations
Cites work
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A method for solving traveling-salesman problems
- A variable depth search algorithm with branching search for the generalized assignment problem
- Algorithms for Large-scale Travelling Salesman Problems
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Computer Solutions of the Traveling Salesman Problem
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Guided local search with shifting bottleneck for job shop scheduling
- Local branching
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Local search algorithms for the radio link frequency assignment problem
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
Cited in
(2)
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)