The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← links)
- Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
- Modeling and optimizing traffic light settings in road networks (Q337395) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- Optimal shift partitioning of pharmacies (Q337411) (← links)
- A new metaheuristic for optimization: optics inspired optimization (OIO) (Q337413) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots (Q337445) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming (Q337450) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- Optimization-based scheduling for the single-satellite, multi-ground station communication problem (Q337472) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- The service overlay network design problem for interactive internet applications (Q337490) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management (Q337504) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
- A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers (Q337512) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks (Q337522) (← links)
- PH-graphs for analyzing shortest path problems with correlated traveling times (Q337529) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks (Q337548) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization (Q337566) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- Determining the timing of project control points using a facility location model and simulation (Q337592) (← links)
- Direct zigzag search for discrete multi-objective optimization (Q337599) (← links)
- A heuristic algorithm for a supply chain's production-distribution planning (Q337603) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation (Q337610) (← links)
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem (Q337612) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- A novel hybrid multi-objective immune algorithm with adaptive differential evolution (Q337634) (← links)
- Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic (Q337636) (← links)
