Shoshana Anily

According to our database, Shoshana Anily authored at least 29 papers between 1987 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Stable matching of student-groups to dormitories.

Nitsan Perach, Shoshana Anily

Eur. J. Oper. Res., 2022

2020

Ticket queues with regular and strategic customers.

Gabi Hanukov, Shoshana Anily, Uri Yechiali

Queueing Syst. Theory Appl., 2020

2014

Subadditive and Homogeneous of Degree One Games Are Totally Balanced.

Shoshana Anily, Moshe Haviv

Oper. Res., 2014

2013

The uncapacitated swapping problem on a line and on a circle.

Shoshana Anily, Aharona Pfeffer

Discret. Appl. Math., 2013

2011

The preemptive swapping problem on a tree.

Shoshana Anily, Michel Gendreau, Gilbert Laporte

Networks, 2011

2010

Cooperation in Service Systems.

Shoshana Anily, Moshe Haviv

Oper. Res., 2010

2009

Multi-item lot-sizing with joint set-up costs.

Shoshana Anily, Michal Tzur, Laurence A. Wolsey

Math. Program., 2009

2008

The Uncapacitated Swapping Problem.

Shoshana Anily, Aharona Pfeffer

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model.

Shoshana Anily, Moshe Haviv

Oper. Res., 2007

2006

An Optimal Lot-Sizing and Offline Inspection Policy in the Case of Nonrigid Demand.

Shoshana Anily, Abraham Grosfeld-Nir

Oper. Res., 2006

Lot-sizing two-echelon assembly systems with random yields and rigid demand.

Abraham Grosfeld-Nir, Shoshana Anily, Tal Ben-Zvi

Eur. J. Oper. Res., 2006

2005

Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach.

Shoshana Anily, Michal Tzur

Transp. Sci., 2005

2004

An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.

Shoshana Anily, Julien Bramel

Discret. Appl. Math., 2004

2002

Optimal Lot Sizes with Geometric Production Yield and Rigid Demand.

Shoshana Anily, Avraham Beja, Amit Mendel

Oper. Res., 2002

2000

Periodic Scheduling with Service Constraints.

Shoshana Anily, Julien Bramel

Oper. Res., 2000

1999

The Swapping Problem on a Line.

Shoshana Anily, Michel Gendreau, Gilbert Laporte

SIAM J. Comput., 1999

A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.

Shoshana Anily, Julien Bramel, Alain Hertz

Oper. Res. Lett., 1999

Scheduling maintenance services to three machines.

Shoshana Anily, Celia A. Glass, Refael Hassin

Ann. Oper. Res., 1999

1998

The Scheduling of Maintenance Service.

Shoshana Anily, Celia A. Glass, Refael Hassin

Discret. Appl. Math., 1998

1994

The traveling salesman problem with delivery and backhauls.

Shoshana Anily, Gur Mosheiov

Oper. Res. Lett., 1994

Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.

Shoshana Anily, Julien Bramel, David Simchi-Levi

Oper. Res., 1994

1993

Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories.

Shoshana Anily, Awi Federgruen

Oper. Res., 1993

1992

The swapping problem.

Shoshana Anily, Refael Hassin

Networks, 1992

1991

Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs.

Shoshana Anily, Awi Federgruen

Oper. Res., 1991

Structured Partitioning Problems.

Shoshana Anily, Awi Federgruen

Oper. Res., 1991

Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds.

Shoshana Anily

Oper. Res., 1991

1990

A Class of Euclidean Routing Problems with General Route Cost Functions.

Shoshana Anily, Awi Federgruen

Math. Oper. Res., 1990

1989

Ranking the Best Binary Trees.

Shoshana Anily, Refael Hassin

SIAM J. Comput., 1989

1987

Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods.

Shoshana Anily, Awi Federgruen

Oper. Res., 1987