The following pages link to Multi-directional local search (Q339654):
Displaying 21 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience (Q320696) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments (Q518257) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- A multi-objective approach for intermodal train load planning (Q1656424) (← links)
- Resource constrained routing and scheduling: review and research prospects (Q1694813) (← links)
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation (Q1754264) (← links)
- Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming'' (Q2669770) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
