The following pages link to Computers \& Operations Research (Q162215):
Displaying 50 items.
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
- Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
- Editorial: Emergent nature inspired algorithms for multi-objective optimization (Q336308) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- Achieving super-linear performance in parallel multi-objective evolutionary algorithms by means of cooperative coevolution (Q336318) (← links)
- A bee colony based optimization approach for simultaneous job scheduling and data replication in grid environments (Q336322) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- A novel micro-population immune multiobjective optimization algorithm (Q336327) (← links)
- A comparative study of different approaches using an outranking relation in a multi-objective evolutionary algorithm (Q336330) (← links)
- Multiobjective cuckoo search for design optimization (Q336332) (← links)
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- MOEA/D + uniform design: a new version of MOEA/D for optimization problems with many objectives (Q336339) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks (Q336345) (← links)
- The \(GI/Geo/1\) queue with Bernoulli-schedule-controlled vacation and vacation interruption (Q336349) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- The synchronized arc and node routing problem: application to road marking (Q336355) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- The value of information in stochastic maximum flow problems (Q336360) (← links)
- An alternating direction method for second-order conic programming (Q336362) (← links)
- Scheduling with compressible and stochastic release dates (Q336364) (← links)
- An adaptive evolutionary approach for real-time vehicle routing and dispatching (Q336366) (← links)
- Solving general multi-class closed queuing networks using parametric decomposition (Q336370) (← links)
- \(MMAP|M|N\) queueing system with impatient heterogeneous customers as a model of a contact center (Q336371) (← links)
- A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry (Q336374) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Inventory management with log-normal demand per unit time (Q336383) (← links)
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
- The impact of false-negative reads on the performance of RFID-based shelf inventory control policies (Q336390) (← links)
- Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites (Q336398) (← links)
- A survey of models and algorithms for emergency response logistics in electric distribution systems. I: Reliability planning with fault considerations (Q336404) (← links)
- A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level (Q336405) (← links)
- Modeling and optimization of a product-service system with additional service capacity and impatient customers (Q336407) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem (Q336419) (← links)
- A stochastic optimization model for real-time ambulance redeployment (Q336420) (← links)
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
- Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic (Q336426) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- Headquarter-centered common sourcing management through order coordination and consolidation (Q336428) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation (Q336432) (← links)
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
- Branch-and-bound algorithm for a competitive facility location problem (Q336436) (← links)
