Shoshana Anily

Orcid: 0000-0001-8527-1659

Affiliations:
  • Tel Aviv University, Israel


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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Stable matching of student-groups to dormitories.
Eur. J. Oper. Res., 2022

2020
Ticket queues with regular and strategic customers.
Queueing Syst. Theory Appl., 2020

2014
Subadditive and Homogeneous of Degree One Games Are Totally Balanced.
Oper. Res., 2014

2013
The uncapacitated swapping problem on a line and on a circle.
Discret. Appl. Math., 2013

2011
The preemptive swapping problem on a tree.
Networks, 2011

2010
Cooperation in Service Systems.
Oper. Res., 2010

2009
Multi-item lot-sizing with joint set-up costs.
Math. Program., 2009

2008
The Uncapacitated Swapping Problem.
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.
Oper. Res., 2007

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

Lot-sizing two-echelon assembly systems with random yields and rigid demand.
Eur. J. Oper. Res., 2006

2005
Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach.
Transp. Sci., 2005

2004
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
Discret. Appl. Math., 2004

2002
Optimal Lot Sizes with Geometric Production Yield and Rigid Demand.
Oper. Res., 2002

2000
Periodic Scheduling with Service Constraints.
Oper. Res., 2000

1999
The Swapping Problem on a Line.
SIAM J. Comput., 1999

A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett., 1999

Scheduling maintenance services to three machines.
Ann. Oper. Res., 1999

1998
The Scheduling of Maintenance Service.
Discret. Appl. Math., 1998

1994
The traveling salesman problem with delivery and backhauls.
Oper. Res. Lett., 1994

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

1993
Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories.
Oper. Res., 1993

1992
The swapping problem.
Networks, 1992

1991
Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs.
Oper. Res., 1991

Structured Partitioning Problems.
Oper. Res., 1991

Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds.
Oper. Res., 1991

1990
A Class of Euclidean Routing Problems with General Route Cost Functions.
Math. Oper. Res., 1990

1989
Ranking the Best Binary Trees.
SIAM J. Comput., 1989

1987
Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods.
Oper. Res., 1987


  Loading...