Pages that link to "Item:Q3156821"
From MaRDI portal
The following pages link to A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem (Q3156821):
Displaying 22 items.
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- MILP-based heuristics for the design of rural community electrification projects (Q342343) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints (Q930933) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← 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)
- A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)
- Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
