default search action
Shoshana Anily
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j28]Nitsan Perach
, Shoshana Anily
Stable matching of student-groups to dormitories. Eur. J. Oper. Res. 302(1): 50-61 (2022) - 2020
- [j27]Gabi Hanukov
Ticket queues with regular and strategic customers. Queueing Syst. Theory Appl. 95(1): 145-171 (2020)
2010 – 2019
- 2014
- [j26]Shoshana Anily, Moshe Haviv:
Subadditive and Homogeneous of Degree One Games Are Totally Balanced. Oper. Res. 62(4): 788-793 (2014) - 2013
- [j25]Shoshana Anily, Aharona Pfeffer:
The uncapacitated swapping problem on a line and on a circle. Discret. Appl. Math. 161(4-5): 454-465 (2013) - 2011
- [j24]Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The preemptive swapping problem on a tree. Networks 58(2): 83-94 (2011) - 2010
- [j23]Shoshana Anily, Moshe Haviv:
Cooperation in Service Systems. Oper. Res. 58(3): 660-673 (2010)
2000 – 2009
- 2009
- [j22]Shoshana Anily, Michal Tzur, Laurence A. Wolsey:
Multi-item lot-sizing with joint set-up costs. Math. Program. 119(1): 79-94 (2009) - 2008
- [c1]Shoshana Anily, Aharona Pfeffer:
The Uncapacitated Swapping Problem. CTW 2008: 139-142 - 2007
- [j21]Shoshana Anily, Moshe Haviv:
The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model. Oper. Res. 55(2): 292-302 (2007) - 2006
- [j20]Abraham Grosfeld-Nir, Shoshana Anily, Tal Ben-Zvi:
Lot-sizing two-echelon assembly systems with random yields and rigid demand. Eur. J. Oper. Res. 173(2): 600-616 (2006) - [j19]Shoshana Anily, Abraham Grosfeld-Nir:
An Optimal Lot-Sizing and Offline Inspection Policy in the Case of Nonrigid Demand. Oper. Res. 54(2): 311-323 (2006) - 2005
- [j18]Shoshana Anily, Michal Tzur:
Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach. Transp. Sci. 39(2): 233-248 (2005) - 2004
- [j17]Shoshana Anily, Julien Bramel:
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. Discret. Appl. Math. 145(1): 22-39 (2004) - 2002
- [j16]Shoshana Anily, Avraham Beja, Amit Mendel:
Optimal Lot Sizes with Geometric Production Yield and Rigid Demand. Oper. Res. 50(3): 424-432 (2002) - 2000
- [j15]Shoshana Anily, Julien Bramel:
Periodic Scheduling with Service Constraints. Oper. Res. 48(4): 635-645 (2000)
1990 – 1999
- 1999
- [j14]Shoshana Anily, Celia A. Glass, Refael Hassin:
Scheduling maintenance services to three machines. Ann. Oper. Res. 86: 375-391 (1999) - [j13]Shoshana Anily, Julien Bramel, Alain Hertz:
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. Oper. Res. Lett. 24(1-2): 29-35 (1999) - [j12]Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The Swapping Problem on a Line. SIAM J. Comput. 29(1): 327-335 (1999) - 1998
- [j11]Shoshana Anily, Celia A. Glass, Refael Hassin:
The Scheduling of Maintenance Service. Discret. Appl. Math. 82(1-3): 27-42 (1998) - 1994
- [j10]Shoshana Anily, Julien Bramel, David Simchi-Levi:
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures. Oper. Res. 42(2): 287-298 (1994) - [j9]Shoshana Anily, Gur Mosheiov:
The traveling salesman problem with delivery and backhauls. Oper. Res. Lett. 16(1): 11-18 (1994) - 1993
- [j8]Shoshana Anily, Awi Federgruen:
Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories. Oper. Res. 41(1): 37-47 (1993) - 1992
- [j7]Shoshana Anily, Refael Hassin:
The swapping problem. Networks 22(4): 419-433 (1992) - 1991
- [j6]Shoshana Anily, Awi Federgruen:
Structured Partitioning Problems. Oper. Res. 39(1): 130-149 (1991) - [j5]Shoshana Anily:
Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds. Oper. Res. 39(2): 233-243 (1991) - [j4]Shoshana Anily, Awi Federgruen:
Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs. Oper. Res. 39(3): 443-455 (1991) - 1990
- [j3]Shoshana Anily, Awi Federgruen:
A Class of Euclidean Routing Problems with General Route Cost Functions. Math. Oper. Res. 15(2): 268-285 (1990)
1980 – 1989
- 1989
- [j2]Shoshana Anily, Refael Hassin:
Ranking the Best Binary Trees. SIAM J. Comput. 18(5): 882-892 (1989) - 1987
- [j1]Shoshana Anily, Awi Federgruen:
Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods. Oper. Res. 35(6): 867-874 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: