The following pages link to Computers \& Operations Research (Q162215):
Displaying 50 items.
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
- A method for improving the accuracy of data mining classification algorithms (Q1017461) (← links)
- Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
- Scheduling of a single crane in batch annealing process (Q1017463) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- Efficient heuristics for inventory placement in acyclic networks (Q1025232) (← links)
- Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
- Scheduling projects with limited number of preemptions (Q1025235) (← links)
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) (← links)
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations (Q1025246) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- A heuristic to manage perishable inventory with batch ordering, positive lead-times, and time-varying demand (Q1025252) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times (Q1025256) (← links)
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
- Tank allocation problems in maritime bulk shipping (Q1025259) (← links)
- The value of postponing online fulfillment decisions in multi-channel retail/e-tail organizations (Q1025261) (← links)
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
- A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265) (← links)
- Guest editorial: Hybrid metaheuristics (Q1038277) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points (Q1038280) (← links)
- DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems (Q1038281) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- Heuristic manipulation, tabu search and frequency assignment (Q1038293) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition (Q1038300) (← links)
- Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization (Q1040957) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- Solving a comprehensive model for multiobjective project portfolio selection (Q1040961) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling (Q1040966) (← links)
- Robust supply chain design under uncertain demand in agile manufacturing (Q1040967) (← links)
