The following pages link to Hande Yaman (Q217040):
Displaying 50 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- A multi-stage stochastic programming approach in master production scheduling (Q421590) (← links)
- The vendor location problem (Q547116) (← links)
- Erratum to: ``Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution'' (Q548285) (← links)
- An intermodal multicommodity routing problem with scheduled services (Q694530) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- Stochastic lot sizing problem with nervousness considerations (Q1652600) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- Convex hull results for the warehouse problem (Q1756347) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- Concentrator location in telecommunications networks. (Q1762564) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Concentrator location in telecommunications (Q1885343) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty (Q2106728) (← links)
- Multi-stage stochastic programming for demand response optimization (Q2185536) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
- Manufacturer's mixed pallet design problem (Q2462174) (← links)
- Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations (Q2899103) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem (Q2997796) (← links)
- Release Time Scheduling and Hub Location for Next-Day Delivery (Q3144404) (← links)
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands (Q3144405) (← links)
- (Q3147665) (← links)
- Projecting the flow variables for hub location problems (Q3156823) (← links)
- The Integer Knapsack Cover Polyhedron (Q3519194) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- Generating Facets for the Independence System Polytope (Q3583320) (← links)
- A stochastic programming approach for Shelter location and evacuation planning (Q4611481) (← links)
- The ring/<i>κ</i>‐rings network design problem: Model and branch‐and‐cut algorithm (Q4642409) (← links)
- Health network mergers and hospital re-planning (Q4933607) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
