Nadia Brauner

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 19

Top Topics

Randomized Algorithm

Top Venues

Int. J. Prod. Res.

Comput. Oper. Res.

Publications

Antoine Lhomme, Nicolas Catusse, Nadia Brauner
Computational bounds on randomized algorithms for online bin stretching. CoRR (2024)
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 (2024)
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 (2024)
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) (2023)
Odile Bellenguez, Nadia Brauner, Alexis Tsoukiàs
Is there an Ethical Operational Research? CoRR (2022)
Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan
Innovative ideas for teaching supports: Application to Graph theory. CoRR (2022)
Thiago Cantos Lopes, Nadia Brauner, Leandro Magatão
Assembly line balancing with fractional task allocations. Int. J. Prod. Res. 60 (5) (2022)
Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner
Online bin stretching lower bounds: Improved search of computational proofs. CoRR (2022)
Hadrien Cambazard, Nicolas Catusse, Nadia Brauner, Pierre Lemaire
Teaching OR: automatic evaluation for linear programming modelling. 4OR 20 (2) (2022)
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 (2021)
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 (2021)
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 (2021)
Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso
Do balanced words have a short period? Theor. Comput. Sci. 793 (2019)
Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint
No-idle Parallel Machine Scheduling of Unit-time Jobs. CoDIT (2019)
Nadia Brauner, Gerd Finke, Yakov M. Shafransky
Lawler's minmax cost problem under uncertainty. J. Comb. Optim. 34 (1) (2017)
Michaël Gabay, Nadia Brauner, Vladimir Kotov
Improved lower bounds for the online bin stretching problem. 4OR 15 (2) (2017)
Michaël Gabay, Christophe Rapine, Nadia Brauner
High-multiplicity scheduling on one machine with forbidden start and completion times. J. Sched. 19 (5) (2016)
Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu
Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19 (4) (2016)
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)
Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke
Identical coupled task scheduling: polynomial complexity of the cyclic case. J. Sched. 18 (6) (2015)
Michaël Gabay, Vladimir Kotov, Nadia Brauner
Online bin stretching with bunch techniques. Theor. Comput. Sci. 602 (2015)
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) (2013)
Christophe Rapine, Nadia Brauner
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. Discret. Optim. 10 (4) (2013)
Ariel Waserhole, Vincent Jost, Nadia Brauner
Pricing techniques for self regulation in Vehicle Sharing Systems. Electron. Notes Discret. Math. 41 (2013)
Julien Darlay, Nadia Brauner, Julien Moncel
Dense and sparse graph partition. Discret. Appl. Math. 160 (16-17) (2012)
Christophe Rapine, Nadia Brauner, Gerd Finke, Vassilissa Lebacque
Single machine scheduling with small operator-non-availability periods. J. Sched. 15 (2) (2012)
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) (2009)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
Operator non-availability periods. 4OR 7 (3) (2009)
Nadia Brauner, Vincent Jost
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. Discret. Math. 308 (11) (2008)
Nadia Brauner
Identical part production in cyclic robotic cells: Concepts, overview and open questions. Discret. Appl. Math. 156 (13) (2008)
Vassilissa Lebacque, Vincent Jost, Nadia Brauner
Simultaneous optimization of classical objectives in JIT scheduling. Eur. J. Oper. Res. 182 (1) (2007)
Pierre Lemaire, Gerd Finke, Nadia Brauner
Models and Complexity of Multibin Packing Problems. J. Math. Model. Algorithms 5 (3) (2006)
Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frédéric Prost
Specializing Narrowing for Timetable Generation: A Case Study. PADL (2005)
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) (2005)
Nadia Brauner, Gerd Finke
Robotic Cells: Configurations, Conjectures and Cycle Functions. OR (2005)
Nadia Brauner, Yves Crama
The maximum deviation just-in-time scheduling problem. Discret. Appl. Math. 134 (1-3) (2004)
Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants
Approximation algorithms for the design of SDH/SONET networks. RAIRO Oper. Res. 37 (4) (2003)
Nadia Brauner, Gerd Finke, Wieslaw Kubiak
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6 (4) (2003)