The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
- A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
- On the abstraction method for the container relocation problem (Q342301) (← links)
- Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics (Q342321) (← links)
- Inventory management for new products with triangularly distributed demand and lead-time (Q342323) (← links)
- An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Scoring procedures for multiple criteria decision aiding with robust and stochastic ordinal regression (Q342336) (← links)
- A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling (Q342339) (← links)
- MILP-based heuristics for the design of rural community electrification projects (Q342343) (← links)
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Investing in lead-time variability reduction in a collaborative vendor-buyer supply chain model with stochastic lead time (Q342365) (← links)
- Computational investigation of simple memetic approaches for continuous global optimization (Q342367) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Mean-univariate GARCH VaR portfolio optimization: actual portfolio approach (Q342374) (← links)
- A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- Variable neighborhood search for the second type of two-sided assembly line balancing problem (Q342398) (← links)
- A multi-objective optimization approach for integrated production planning under interval uncertainties in the steel industry (Q342399) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Splitting for optimization (Q342427) (← links)
- Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- Social structure optimization in team formation (Q342472) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- A multi-objective co-evolutionary algorithm for energy-efficient scheduling on a green data center (Q342514) (← links)
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model (Q342516) (← links)
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization (Q342520) (← links)
- Increasing discrimination of DEA evaluation by utilizing distances to anti-efficient frontiers (Q342529) (← links)
