The following pages link to Tolga Bektaş (Q286690):
Displaying 47 items.
- Generalized minimum spanning tree games (Q286691) (← links)
- A review of recent research on green road freight transportation (Q296573) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- (Q596293) (redirect page) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem (Q879323) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration (Q1011169) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- A new formulation for the combined maritime fleet deployment and inventory management problem (Q1691683) (← links)
- The green location-routing problem (Q1722977) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Optimal spare parts management for vessel maintenance scheduling (Q1730631) (← links)
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
- The role of operational research in green freight transportation (Q1755374) (← links)
- Route and speed optimization for autonomous trucks (Q1782162) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Efficient computation of the Shapley value for large-scale linear production games (Q2177801) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
- The bi-objective pollution-routing problem (Q2255967) (← links)
- Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs (Q2357879) (← links)
- An extended lifetime measure for telecommunications networks: improvements and implementations (Q2450815) (← links)
- Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses (Q3502137) (← links)
- Solving school bus routing problems through integer programming (Q3518805) (← links)
- Cellular manufacturing systems design with routing flexibility, machine procurement, production planning and dynamic system reconfiguration (Q3623401) (← links)
- Transformations of node‐balanced routing problems (Q4632892) (← links)
- Optimal vehicle routing with lower and upper bounds on route durations (Q4642459) (← links)
- Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
- Computational Science – ICCS 2005 (Q5709516) (← links)
- Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique (Q6102822) (← links)
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics (Q6109810) (← links)
- The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
