The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Optimization analysis of an unreliable multi-server queue with a controllable repair policy (Q342016) (← links)
- A non-parametric approach to demand forecasting in revenue management (Q342029) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- Generating new test instances by evolving in instance space (Q342041) (← links)
- Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms (Q342044) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- A leader-follower model for discrete competitive facility location (Q342067) (← links)
- Robust energy-aware routing with redundancy elimination (Q342072) (← links)
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
- Optimizing horizontal alignment of roads in a specified corridor (Q342077) (← links)
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction (Q342078) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem (Q342089) (← links)
- An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping (Q342095) (← links)
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- A nested semi-open queuing network model for analyzing dine-in restaurant performance (Q342107) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques (Q342143) (← links)
- Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization (Q342154) (← links)
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages (Q342190) (← links)
- A deterministic method for the unit commitment problem in power systems (Q342197) (← links)
- Energy management in storage-augmented, grid-connected prosumer buildings and neighborhoods using a modified simulated annealing optimization (Q342200) (← links)
- On the dynamics of eco-efficiency performance in the European Union (Q342228) (← links)
- Measuring regional efficiency of energy and carbon dioxide emissions in China: a chance constrained DEA approach (Q342231) (← links)
- Model uncertainty and energy technology policy: the example of induced technical change (Q342234) (← links)
- Modeling spot price dependence in Australian electricity markets with applications to risk management (Q342246) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- The matrix-form solution for \(Geo^{X}/G/1/N\) working vacation queue and its application to state-dependent cost control (Q342258) (← links)
- Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations (Q342272) (← links)
