Nadia Brauner

41 papers A* 1C 2Journal 36Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
From decision aiding to the massive use of algorithms: where does the responsibility stand?
AI Ethics
Odile Bellenguez, Nadia Brauner, Alexis Tsoukiàs
2025 J jnl
On the convergence of computational methods for the online bin stretching problem.
CoRR
Antoine Lhomme, Nicolas Catusse, Nadia Brauner
2024 J jnl
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty.
Discret. Appl. Math.
Nadia Brauner, Evgeny Gurevsky, Mikhail Y. Kovalyov
2024 J jnl
Computational bounds on randomized algorithms for online bin stretching.
CoRR
Antoine Lhomme, Nicolas Catusse, Nadia Brauner
2024 J jnl
Stability constraints in a 3D knapsack problem with non parallelepipedic items.
Comput. Ind. Eng.
Alexandre Le Jean, Nadia Brauner, Olivier Briant, Mircea Cocan, Bérenger David
2023 J jnl
Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study.
Int. J. Prod. Res.
Thiago Cantos Lopes, Adalberto Sato Michels, Nadia Brauner, Leandro Magatão
2022 J jnl
Assembly line balancing with fractional task allocations.
Int. J. Prod. Res.
Thiago Cantos Lopes, Nadia Brauner, Leandro Magatão
2022 J jnl
Innovative ideas for teaching supports: Application to Graph theory.
CoRR
Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan
2022 J jnl
Is there an Ethical Operational Research?
CoRR
Odile Bellenguez, Nadia Brauner, Alexis Tsoukiàs
2022 J jnl
Online bin stretching lower bounds: Improved search of computational proofs.
CoRR
Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner
2022 J jnl
Teaching OR: automatic evaluation for linear programming modelling.
4OR
Hadrien Cambazard, Nicolas Catusse, Nadia Brauner, Pierre Lemaire
2021 J jnl
Assembly line balancing for two cycle times: Anticipating demand fluctuations.
Comput. Ind. Eng.
Thiago Cantos Lopes, Adalberto Sato Michels, Celso Gustavo Stall Sikora, Nadia Brauner, Leandro Magatão
2021 J jnl
Fleet and charging infrastructure decisions for fast-charging city electric bus service.
Comput. Oper. Res.
Nikolai Guschinsky, Mikhail Y. Kovalyov, Boris Rozin, Nadia Brauner
2021 J jnl
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines.
Comput. Oper. Res.
Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint
2019 J jnl
Do balanced words have a short period?
Theor. Comput. Sci.
Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso
2019 C conf
No-idle Parallel Machine Scheduling of Unit-time Jobs.
CoDIT
Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint
2017 J jnl
Improved lower bounds for the online bin stretching problem.
4OR
Michaël Gabay, Nadia Brauner, Vladimir Kotov
2017 J jnl
Lawler's minmax cost problem under uncertainty.
J. Comb. Optim.
Nadia Brauner, Gerd Finke, Yakov M. Shafransky
2016 A* conf
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope.
IJCAI
Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini
2016 J jnl
High-multiplicity scheduling on one machine with forbidden start and completion times.
J. Sched.
Michaël Gabay, Christophe Rapine, Nadia Brauner
2016 J jnl
Lawler's minmax cost algorithm: optimality conditions and uncertainty.
J. Sched.
Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu
2015 J jnl
Identical coupled task scheduling: polynomial complexity of the cyclic case.
J. Sched.
Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke
2015 J jnl
Online bin stretching with bunch techniques.
Theor. Comput. Sci.
Michaël Gabay, Vladimir Kotov, Nadia Brauner
2013 J jnl
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Discret. Optim.
Christophe Rapine, Nadia Brauner
2013 J jnl
LAD models, trees, and an analog of the fundamental theorem of arithmetic.
Discret. Appl. Math.
Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier
2013 J jnl
Pricing techniques for self regulation in Vehicle Sharing Systems.
Electron. Notes Discret. Math.
Ariel Waserhole, Vincent Jost, Nadia Brauner
2012 J jnl
Dense and sparse graph partition.
Discret. Appl. Math.
Julien Darlay, Nadia Brauner, Julien Moncel
2012 J jnl
Single machine scheduling with small operator-non-availability periods.
J. Sched.
Christophe Rapine, Nadia Brauner, Gerd Finke, Vassilissa Lebacque
2009 J jnl
Operator non-availability periods.
4OR
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
2009 J jnl
Scheduling of coupled tasks and one-machine no-wait robotic cells.
Comput. Oper. Res.
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead
2008 J jnl
Identical part production in cyclic robotic cells: Concepts, overview and open questions.
Discret. Appl. Math.
Nadia Brauner
2008 J jnl
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture.
Discret. Math.
Nadia Brauner, Vincent Jost
2007 J jnl
Simultaneous optimization of classical objectives in JIT scheduling.
Eur. J. Oper. Res.
Vassilissa Lebacque, Vincent Jost, Nadia Brauner
2006 J jnl
Models and Complexity of Multibin Packing Problems.
J. Math. Model. Algorithms
Pierre Lemaire, Gerd Finke, Nadia Brauner
2005 J jnl
A Framework for the Complexity of High-Multiplicity Scheduling Problems.
J. Comb. Optim.
Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert
2005 — conf
Robotic Cells: Configurations, Conjectures and Cycle Functions.
OR
Nadia Brauner, Gerd Finke
2005 C conf
Specializing Narrowing for Timetable Generation: A Case Study.
PADL
Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frédéric Prost
2004 — ch.
Scheduling with Discrete Resource Constraints.
Handbook of Scheduling
Jacek Blazewicz, Nadia Brauner, Gerd Finke
2004 J jnl
The maximum deviation just-in-time scheduling problem.
Discret. Appl. Math.
Nadia Brauner, Yves Crama
2003 J jnl
Approximation algorithms for the design of SDH/SONET networks.
RAIRO Oper. Res.
Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants
2003 J jnl
Complexity of One-Cycle Robotic Flow-Shops.
J. Sched.
Nadia Brauner, Gerd Finke, Wieslaw Kubiak
requirements.txt
← Index requirements.txt plaintext 
asn1crypto==1.5.1
dotnetfile==0.2.4
elasticsearch==8.15.0
magika==1.0.1
modules==1.0.0
pefile==2023.2.7
py7zr==0.22.0
python-magic==0.4.27
pyzipper==0.3.6
py-tlsh==4.7.2
bitstring==4.2.3
Pillow==10.4.0
setuptools==75.1.0
ppdeep==20200505
cryptography==43.0.3
flare-floss==3.1.1
#stringsifter==3.20230711
signify==0.7.1
yara-x==1.9.0
xxhash==3.6.0
git+https://github.com/wbond/oscrypto.git@1547f535001ba568b239b8797465536759c742a3
pycryptodomex==3.20.0
redis==6.4.0
clickhouse-connect==0.8.13
minio==7.2.15
requests==2.33.1
pyelftools==0.32
python-dotenv
psutil
numpy
mmh3
blake3
machofile==2026.02.10
lief==0.17.3
androguard>=4.1
permhash
jsbeautifier>=1.14.0
chardet==7.4.1
pyjsparser>=2.7.1

# Development and linting tools
flake8
pylint
black
isort