The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Levels of incomplete information in group decision models -- a comprehensive simulation study (Q337125) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines (Q337140) (← links)
- An effective heuristic for multistage linear programming with a stochastic right-hand side (Q337144) (← links)
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- Test problem generator for unconstrained global optimization (Q337165) (← links)
- Multi-objective optimization models for patient allocation during a pandemic influenza outbreak (Q337169) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization (Q337202) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
- A variable neighborhood search particle filter for bearings-only target tracking (Q337209) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions (Q337215) (← links)
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach (Q337234) (← links)
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
- \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS (Q337243) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- An innovative multi-agent search-and-rescue path planning approach (Q337250) (← links)
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines (Q337254) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- A decision support tool for generating shipping data for the Hunter Valley coal chain (Q337259) (← links)
- Simulation-based optimization for housekeeping in a container transshipment terminal (Q337263) (← links)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- A simulation-based decision support system for a multi-echelon inventory problem with service level constraints (Q337270) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Exploring the economic consequences of letting a supplier hold reserve storage (Q337286) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299) (← links)
- Product mix optimization for a semiconductor fab: modeling approaches and decomposition techniques (Q337317) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A two level metaheuristic for the operating room scheduling and assignment problem (Q337329) (← links)
- Model and heuristics for the assembly line worker integration and balancing problem (Q337340) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Stochastic integer programming models for reducing wastages and shortages of blood products at hospitals (Q337351) (← links)
