The following pages link to Local branching (Q1424277):
Displaying 50 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- A bilevel planning model for public-private partnership (Q276164) (← links)
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Capacity consumption analysis using heuristic solution method for under construction railway routes (Q291652) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
- Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- The air-cargo consolidation problem with pivot weight: models and solution methods (Q337525) (← links)
- A stochastic programming model for multi-product oriented multi-channel component replenishment (Q337560) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem (Q342548) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Global optima for the Zhou-Rozvany problem (Q381557) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions (Q421648) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- A variable depth search branching (Q453047) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Water distribution networks design under uncertainty (Q526639) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
