The following pages link to Local branching (Q1424277):
Displaying 50 items.
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges (Q1687653) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- Integrated planning of ship deployment, service schedule and container routing (Q1725620) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- The design of transparent optical networks minimizing the impact of critical nodes (Q1742217) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
- The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling (Q1999394) (← links)
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning (Q2005795) (← links)
- The two-echelon production-routing problem (Q2028880) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- Bi-objective facility location under uncertainty with an application in last-mile disaster relief (Q2108809) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Variable neighborhood descent branching applied to the multi-way number partitioning problem (Q2132377) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
