The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots (Q336565) (← links)
- Two approaches for solving the buffer allocation problem in unreliable production lines (Q336569) (← links)
- A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics (Q336577) (← links)
- Coupling a memetic algorithm to simulation models for promising multi-period asset allocations (Q336580) (← links)
- Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line (Q336585) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- An operational policy for an integrated inventory system under consignment stock policy with controllable lead time and buyers' space limitation (Q336594) (← links)
- An efficient implementation of the Min-Min heuristic (Q336601) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651) (← links)
- An integrated search heuristic for large-scale flexible job shop scheduling problems (Q336652) (← links)
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty (Q336654) (← links)
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
- A parallel ordering problem in facilities layout (Q336660) (← links)
- Single product, finite horizon, periodic review inventory model with working capital requirements and short-term debt (Q336662) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization (Q336664) (← links)
- An efficient two phase approach for solving reliability-redundancy allocation problem using artificial bee colony technique (Q336668) (← links)
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
- Branch and bound algorithms for the bus evacuation problem (Q336688) (← links)
- Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm (Q336698) (← links)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A hybrid column generation with GRASP and path relinking for the network load balancing problem (Q336721) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- An exact solution approach for multi-objective location-transportation problem for disaster response (Q336763) (← links)
- Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning (Q336777) (← links)
- Liner shipping network design with deadlines (Q336778) (← links)
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781) (← links)
- Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802) (← links)
- A continuous bi-level model for the expansion of highway networks (Q336804) (← links)
- A trilevel programming approach for electric grid defense planning (Q336810) (← links)
