default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Bramel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
[j11]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)- 2000
- [j10]Julien Bramel, Shobhna Goyal, Paul H. Zipkin:
Coordination of Production/Distribution Networks with Unbalanced Leadtimes. Oper. Res. 48(4): 570-577 (2000) - [j9]Shoshana Anily, Julien Bramel:
Periodic Scheduling with Service Constraints. Oper. Res. 48(4): 635-645 (2000) - 1999
- [j8]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) - 1998
- [j7]Lap Mui Ann Chan, David Simchi-Levi, Julien Bramel:
Worst-case analyses, linear programming and the bin-packing problem. Math. Program. 83: 213-227 (1998) - 1997
- [j6]Julien Bramel, David Simchi-Levi:
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows. Oper. Res. 45(2): 295-301 (1997) - 1996
- [j5]Julien Bramel, David Simchi-Levi:
Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Oper. Res. 44(3): 501-509 (1996) - 1995
- [j4]Julien Bramel, David Simchi-Levi:
A Location Based Heuristic for General Routing Problems. Oper. Res. 43(4): 649-660 (1995) - 1994
- [j3]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) - 1993
- [j2]Daniel Bienstock, Julien Bramel, David Simchi-Levi:
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Math. Oper. Res. 18(4): 786-802 (1993) - 1992
- [j1]Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi:
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Oper. Res. 40(6): 1095-1106 (1992)
Parts in Books or Collections
- 2002
- [p1]Julien Bramel, David Simchi-Levi:
Set-Covering-Based Algorithms for the Capacitated VRP. The Vehicle Routing Problem 2002: 85-108
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-04-26 18:25 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:
