The following pages link to Local branching (Q1424277):
Displaying 50 items.
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Quality recovering of university timetables (Q666944) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Integer-programming software systems (Q817202) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Branching strategies to improve regularity of crew schedules in ex-urban public transit (Q841588) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs (Q1026920) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Optimizing production and transportation in a commit-to-delivery business mode (Q1046062) (← links)
- Deep neural networks and mixed integer linear optimization (Q1617390) (← links)
- A two-stage approach to the UCITS-constrained index-tracking problem (Q1634070) (← links)
- The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
- A decomposition heuristic for a rich production routing problem (Q1651659) (← links)
- A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks (Q1652223) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- Robust gateway placement in wireless mesh networks (Q1652709) (← links)
