default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadia Brauner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Alexandre Le Jean
, Nadia Brauner, Olivier Briant, Mircea Cocan, Bérenger David:
Stability constraints in a 3D knapsack problem with non parallelepipedic items. Comput. Ind. Eng. 189: 109943 (2024)- [j29]Nadia Brauner, Evgeny Gurevsky, Mikhail Y. Kovalyov:
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty. Discret. Appl. Math. 349: 106-112 (2024) - [i4]Antoine Lhomme, Nicolas Catusse, Nadia Brauner:
Computational bounds on randomized algorithms for online bin stretching. CoRR abs/2405.19071 (2024) - 2023
- [j28]Thiago Cantos Lopes, Adalberto Sato Michels, Nadia Brauner, Leandro Magatão:
Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study. Int. J. Prod. Res. 61(17): 5901-5917 (2023) - 2022
- [j27]Hadrien Cambazard, Nicolas Catusse, Nadia Brauner, Pierre Lemaire:
Teaching OR: automatic evaluation for linear programming modelling. 4OR 20(2): 333-345 (2022) - [j26]Thiago Cantos Lopes, Nadia Brauner, Leandro Magatão:
Assembly line balancing with fractional task allocations. Int. J. Prod. Res. 60(5): 1569-1586 (2022) - [i3]Odile Bellenguez, Nadia Brauner, Alexis Tsoukiàs:
Is there an Ethical Operational Research? CoRR abs/2207.01502 (2022) - [i2]Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner:
Online bin stretching lower bounds: Improved search of computational proofs. CoRR abs/2207.04931 (2022) - [i1]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan:
Innovative ideas for teaching supports: Application to Graph theory. CoRR abs/2209.05078 (2022) - 2021
- [j25]Thiago Cantos Lopes, Adalberto Sato Michels, Celso Gustavo Stall Sikora, Nadia Brauner, Leandro Magatão:
Assembly line balancing for two cycle times: Anticipating demand fluctuations. Comput. Ind. Eng. 162: 107685 (2021) - [j24]Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint:
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines. Comput. Oper. Res. 132: 105315 (2021) - [j23]Nikolai Guschinsky, Mikhail Y. Kovalyov, Boris Rozin, Nadia Brauner:
Fleet and charging infrastructure decisions for fast-charging city electric bus service. Comput. Oper. Res. 135: 105449 (2021)
2010 – 2019
- 2019
- [j22]Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso:
Do balanced words have a short period? Theor. Comput. Sci. 793: 169-180 (2019) - [c4]Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint:
No-idle Parallel Machine Scheduling of Unit-time Jobs. CoDIT 2019: 807-811 - 2017
- [j21]Michaël Gabay, Nadia Brauner, Vladimir Kotov:
Improved lower bounds for the online bin stretching problem. 4OR 15(2): 183-199 (2017) - [j20]Nadia Brauner, Gerd Finke, Yakov M. Shafransky:
Lawler's minmax cost problem under uncertainty. J. Comb. Optim. 34(1): 31-46 (2017) - 2016
- [j19]Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu:
Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19(4): 401-408 (2016) - [j18]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) - [c3]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini:
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. IJCAI 2016: 3060-3066 - 2015
- [j17]Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke:
Identical coupled task scheduling: polynomial complexity of the cyclic case. J. Sched. 18(6): 631-644 (2015) - [j16]Michaël Gabay, Vladimir Kotov, Nadia Brauner:
Online bin stretching with bunch techniques. Theor. Comput. Sci. 602: 103-113 (2015) - 2013
- [j15]Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier:
LAD models, trees, and an analog of the fundamental theorem of arithmetic. Discret. Appl. Math. 161(7-8): 909-920 (2013) - [j14]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) - [j13]Ariel Waserhole, Vincent Jost, Nadia Brauner:
Pricing techniques for self regulation in Vehicle Sharing Systems. Electron. Notes Discret. Math. 41: 149-156 (2013) - 2012
- [j12]Julien Darlay, Nadia Brauner, Julien Moncel:
Dense and sparse graph partition. Discret. Appl. Math. 160(16-17): 2389-2396 (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)
2000 – 2009
- 2009
- [j10]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) - [j9]Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead:
Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput. Oper. Res. 36(2): 301-307 (2009) - 2008
- [j8]Nadia Brauner:
Identical part production in cyclic robotic cells: Concepts, overview and open questions. Discret. Appl. Math. 156(13): 2480-2492 (2008) - [j7]Nadia Brauner, Vincent Jost:
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. Discret. Math. 308(11): 2319-2324 (2008) - 2007
- [j6]Vassilissa Lebacque, Vincent Jost, Nadia Brauner:
Simultaneous optimization of classical objectives in JIT scheduling. Eur. J. Oper. Res. 182(1): 29-39 (2007) - 2006
- [j5]Pierre Lemaire, Gerd Finke, Nadia Brauner:
Models and Complexity of Multibin Packing Problems. J. Math. Model. Algorithms 5(3): 353-370 (2006) - 2005
- [j4]Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert:
A Framework for the Complexity of High-Multiplicity Scheduling Problems. J. Comb. Optim. 9(3): 313-323 (2005) - [c2]Nadia Brauner, Gerd Finke:
Robotic Cells: Configurations, Conjectures and Cycle Functions. OR 2005: 721-726 - [c1]Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frédéric Prost:
Specializing Narrowing for Timetable Generation: A Case Study. PADL 2005: 22-36 - 2004
- [j3]Nadia Brauner, Yves Crama:
The maximum deviation just-in-time scheduling problem. Discret. Appl. Math. 134(1-3): 25-50 (2004) - [r1]Jacek Blazewicz, Nadia Brauner, Gerd Finke:
Scheduling with Discrete Resource Constraints. Handbook of Scheduling 2004 - 2003
- [j2]Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants:
Approximation algorithms for the design of SDH/SONET networks. RAIRO Oper. Res. 37(4): 235-247 (2003) - [j1]Nadia Brauner, Gerd Finke, Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6(4): 355-372 (2003)
1990 – 1999
- 1999
- [b1]Nadia Brauner-Vettier:
Ordonnancement dans des cellules robotisées. (Scheduling in robotic cells). Joseph Fourier University, Grenoble, France, 1999
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-06-25 20:58 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:
