The following pages link to Computers \& Operations Research (Q162215):
Displaying 50 items.
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Optimizing the strategic patient mix combining queueing theory and dynamic programming (Q336926) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation (Q336964) (← links)
- Erratum to ``Optimizing the strategic patient mix combining queueing theory and dynamic programing'' (Q336979) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- A two level metaheuristic for the operating room scheduling and assignment problem (Q337329) (← links)
- A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots (Q337445) (← links)
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches (Q337674) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Tabu search and lower bounds for a combined production-transportation problem (Q340247) (← links)
- Countering the negative search bias of ant colony optimization in subset selection problems (Q340288) (← links)
- Generating new test instances by evolving in instance space (Q342041) (← links)
- Balancing of parallel U-shaped assembly lines (Q342092) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- Sourcing strategies in supply risk management: an approximate dynamic programming approach (Q502456) (← links)
- Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows'' (Q502476) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- An evolutionary method for complex-process optimization (Q732898) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems (Q875398) (← links)
- An acquisition policy for a multi-supplier system with a finite-time horizon (Q875424) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- Scale-invariant clustering with minimum volume ellipsoids (Q941528) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- The multi-period incremental service facility location problem (Q960382) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Simple procedures of choice in multicriteria problems without precise information about the alternatives' values (Q991388) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- Evaluating project completion time in project networks with discrete random activity durations (Q1017440) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
