The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Optimal decision making in multi-product dual sourcing procurement with demand forecast updating (Q336814) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
- A math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← links)
- Using the TODIM-FSE method as a decision-making support methodology for oil spill response (Q336853) (← links)
- A FTA-based method for risk decision-making in emergency response (Q336855) (← links)
- Risk decision analysis in emergency response: a method based on cumulative prospect theory (Q336858) (← links)
- An integrated expert system for fast disaster assessment (Q336862) (← links)
- Oil-importing optimal decision considering country risk with extreme events: a multi-objective programming approach (Q336867) (← links)
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem (Q336886) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- The vehicle rescheduling problem (Q336901) (← links)
- A holonic approach to flexible flow shop scheduling under stochastic processing times (Q336906) (← links)
- Differential evolution methods based on local searches (Q336908) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- A mixed integer linear model for clustering with variable selection (Q336929) (← links)
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- A nested heuristic for parameter tuning in support vector machines (Q336941) (← links)
- Single liner shipping service design (Q336948) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970) (← links)
- Single machine scheduling with interfering job sets (Q336975) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- An improved truncation technique to analyze a \(Geo/PH/1\) retrial queue with impatient customers (Q336997) (← links)
- Interactive minimax optimisation for integrated performance analysis and resource planning (Q336998) (← links)
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available (Q337001) (← links)
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- Optimization strategy of credit line management for credit card business (Q337050) (← links)
- Parallel machine scheduling problem with preemptive jobs and transportation delay (Q337061) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours (Q337075) (← links)
- A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations (Q337079) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- A lower bound for the quickest path problem (Q337093) (← links)
- A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
