Остановите войну!
for scientists:
default search action
Christophe Rapine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
- [j27]Guillaume Goisque, Christophe Rapine:
An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels. Eur. J. Oper. Res. 261(3): 918-928 (2017) - [j26]Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer:
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. Math. Oper. Res. 42(3): 854-875 (2017) - 2016
- [j25]Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Bernard Penz, Christophe Rapine:
The single-item green lot-sizing problem with fixed carbon emissions. Eur. J. Oper. Res. 248(3): 849-855 (2016) - [j24]Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer:
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. Eur. J. Oper. Res. 250(1): 155-163 (2016) - [j23]Michaël Gabay, Christophe Rapine, Nadia Brauner:
High-multiplicity scheduling on one machine with forbidden start and completion times. J. Sched. 19(5): 609-616 (2016) - [j22]David Rey, Christophe Rapine, Rémy Fondacci, Nour-Eddin El Faouzi:
Subliminal Speed Control in Air Traffic Management: Optimization and Simulation. Transp. Sci. 50(1): 240-262 (2016) - 2015
- [j21]Ayse Akbalik, Bernard Penz, Christophe Rapine:
Capacitated lot sizing problems with inventory bounds. Ann. Oper. Res. 229(1): 1-18 (2015) - [j20]Ayse Akbalik, Bernard Penz, Christophe Rapine:
Multi-item uncapacitated lot sizing problem with inventory bounds. Optim. Lett. 9(1): 143-154 (2015) - [j19]David Rey, Christophe Rapine, Vinayak V. Dixit, S. Travis Waller:
Equity-Oriented Aircraft Collision Avoidance Model. IEEE Trans. Intell. Transp. Syst. 16(1): 172-183 (2015) - 2014
- [j18]Guillaume Massonnet, Jean-Philippe Gayon, Christophe Rapine:
Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand. Eur. J. Oper. Res. 234(3): 641-649 (2014) - [j17]Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci:
A 4D-sequencing approach for air traffic management. Eur. J. Oper. Res. 237(2): 411-425 (2014) - 2013
- [j16]Damien Prot, Christophe Rapine:
Approximations for the Two-Machine Cross-Docking Flow Shop Problem. Discret. Appl. Math. 161(13-14): 2107-2119 (2013) - [j15]Christophe Rapine, Nadia Brauner:
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. Discret. Optim. 10(4): 241-250 (2013) - [j14]Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Bernard Penz, Christophe Rapine:
Lot sizing with carbon emission constraints. Eur. J. Oper. Res. 227(1): 55-61 (2013) - [j13]Ayse Akbalik, Christophe Rapine:
The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases. Eur. J. Oper. Res. 229(2): 353-363 (2013) - 2012
- [j12]Ayse Akbalik, Christophe Rapine:
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost. Oper. Res. Lett. 40(5): 390-397 (2012) - [j11]Christophe Rapine, Nadia Brauner, Gerd Finke, Vassilissa Lebacque:
Single machine scheduling with small operator-non-availability periods. J. Sched. 15(2): 127-139 (2012) - 2010
- [j10]Jurij Mihelic, Amine Mahjoub, Christophe Rapine, Borut Robic:
Two-stage flexible-choice problems under uncertainty. Eur. J. Oper. Res. 201(2): 399-403 (2010) - [j9]Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci:
Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate. Eur. J. Oper. Res. 207(1): 184-196 (2010) - 2009
- [j8]Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich:
Operator non-availability periods. 4OR 7(3): 239-253 (2009) - 2008
- [j7]Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine:
Bicriteria scheduling for contiguous and non contiguous parallel tasks. Ann. Oper. Res. 159(1): 97-106 (2008) - [j6]Julien Boissière, Yannick Frein, Christophe Rapine:
Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand. Eur. J. Oper. Res. 186(2): 608-619 (2008) - 2007
- [j5]Gregory Mounie, Christophe Rapine, Denis Trystram:
A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks. SIAM J. Comput. 37(2): 401-412 (2007) - 2005
- [j4]Cherif Sadfi, Bernard Penz, Christophe Rapine, Jacek Blazewicz, Piotr Formanowicz:
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur. J. Oper. Res. 161(1): 3-10 (2005) - 2001
- [j3]A. Goldman, Christophe Rapine:
Scheduling with Duplication on m Processors with Small Communication Delays. Electron. Notes Discret. Math. 7: 182-185 (2001) - [j2]Bernard Penz, Christophe Rapine, Denis Trystram:
Sensitivity analysis of scheduling algorithms. Eur. J. Oper. Res. 134(3): 606-615 (2001) - 1997
- [j1]Frédéric Guinand, Christophe Rapine, Denis Trystram:
Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays. IEEE Trans. Parallel Distributed Syst. 8(10): 1085-1086 (1997)
Conference and Workshop Papers
- 2014
- [c9]Ayse Akbalik, Christophe Rapine:
Single-item lot sizing problem with carbon emission under the cap-and-trade policy. CoDIT 2014: 30-35 - 2011
- [c8]Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon:
A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. SODA 2011: 67-79 - 2002
- [c7]Claude Yugma, Lionel Dupont, Christophe Rapine:
Portfolio selection and scheduling on a single machine environment. SMC 2002: 6 - [c6]Claude Yugma, Lionel Dupont, Christophe Rapine:
Portfolio selection and scheduling on a single machine environment. SMC (2) 2002: 6 - [c5]Renaud Lepère, Christophe Rapine:
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. STACS 2002: 154-165 - 1999
- [c4]Grégory Mounié, Christophe Rapine, Denis Trystram:
Efficient Approximation Algorithms for Scheduling Malleable Tasks. SPAA 1999: 23-32 - 1998
- [c3]Christophe Rapine, Isaac D. Scherson, Denis Trystram:
On-Line Scheduling of Parallelizable Jobs. Euro-Par 1998: 322-327 - 1996
- [c2]Christophe Rapine, Denis Trystram:
Iterative Approach for the Clustering Problem. Euro-Par, Vol. II 1996: 527-534 - 1995
- [c1]Frédéric Guinand, Christophe Rapine:
Scheduling Strategies for Parallel Programming Environments. PARCO 1995: 407-414
Informal and Other Publications
- 2017
- [i1]Imed Kacem, Christophe Rapine:
Approximation Algorithms for the Open Shop Problem with Delivery Times. CoRR abs/1706.02019 (2017)
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 2023-09-27 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint