The following pages link to Shoshana Anily (Q705494):
Displayed 37 items.
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem (Q705496) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Scheduling maintenance services to three machines (Q1290156) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- The traveling salesman problem with delivery and backhauls (Q1342089) (← links)
- The general multi-retailer EOQ problem with vehicle routing costs (Q1342645) (← links)
- The scheduling of maintenance service (Q1383367) (← links)
- The uncapacitated swapping problem on a line and on a circle (Q1941377) (← links)
- Stable matching of student-groups to dormitories (Q2140313) (← links)
- Ticket queues with regular and strategic customers (Q2210666) (← links)
- Lot-sizing two-echelon assembly systems with random yields and rigid demand (Q2496081) (← links)
- Subadditive and Homogeneous of Degree One Games Are Totally Balanced (Q2931699) (← links)
- Cooperation in Service Systems (Q3098264) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs (Q3359981) (← links)
- Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds (Q3362077) (← links)
- An Optimal Lot-Sizing and Offline Inspection Policy in the Case of Nonrigid Demand (Q3391978) (← links)
- The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model (Q3392076) (← links)
- Algorithms for the multi-item multi-vehicles dynamic lot sizing problem (Q3423273) (← links)
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs (Q3470228) (← links)
- Optimal Lot Sizes with Geometric Production Yield and Rigid Demand (Q3635103) (← links)
- Simulated annealing methods with general acceptance probabilities (Q3764964) (← links)
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods (Q3780216) (← links)
- Ranking the Best Binary Trees (Q3833632) (← links)
- Structured Partitioning Problems (Q3981513) (← links)
- The swapping problem (Q4018998) (← links)
- The Swapping Problem on a Line (Q4268883) (← links)
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures (Q4301293) (← links)
- (Q4499899) (← links)
- Periodic Scheduling with Service Constraints (Q4530657) (← links)
- Full characterization of the nonnegative core of some cooperative games (Q4633005) (← links)
- A probabilistic analysis of a fixed partition policy for the inventory-routing problem (Q4651724) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- The vehicle-routing problem with delivery and back-haul options (Q4883161) (← links)
- Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories (Q5288137) (← links)
- A Class of Euclidean Routing Problems with General Route Cost Functions (Q5753735) (← links)
- The price of anarchy in loss systems (Q6053136) (← links)