The following pages link to Local branching (Q1424277):
Displaying 50 items.
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- Generative deep learning for decision making in gas networks (Q2155386) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- A learning large neighborhood search for the staff rerostering problem (Q2170207) (← links)
- Decision-based scenario clustering for decision-making under uncertainty (Q2171324) (← links)
- Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
- Optimizing locations and scales of emergency warehouses based on damage scenarios (Q2223267) (← links)
- Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems (Q2242249) (← links)
- Warm-start heuristic for stochastic portfolio optimization with fixed and proportional transaction costs (Q2247929) (← links)
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand (Q2253993) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Pivot and shift -- a mixed integer programming heuristic (Q2386208) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- Hybrid heuristics for a short sea inventory routing problem (Q2514744) (← links)
- The feasibility pump (Q2571001) (← links)
- A variable neighborhood search branching for the electric vehicle routing problem with time windows (Q2631269) (← links)
- Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (Q2631277) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
