François Soumis

Orcid: 0000-0002-4579-7696

According to our database1, François Soumis authored at least 103 papers between 1984 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A multiphase dynamic programming algorithm for the shortest path problem with resource constraints.
Eur. J. Oper. Res., 2024

2023
MPILS: An Automatic Tuner for MILP Solvers.
Comput. Oper. Res., November, 2023

2022
Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering.
Comput. Oper. Res., 2022

2021
A mixed integer linear programming model for multi-sector planning using speed and heading changes.
Comput. Oper. Res., 2021

Structured Convolutional Kernel Networks for Airline Crew Scheduling.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem.
Transp. Sci., 2020

A Primal Adjacency-Based Algorithm for the Shortest Path Problem with Resource Constraints.
Transp. Sci., 2020

Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems.
Oper. Res. Forum, 2020

Primal column generation framework for vehicle and crew scheduling problems.
Networks, 2020

Alternating Lagrangian decomposition for integrated airline crew scheduling problem.
Eur. J. Oper. Res., 2020

A branch-and-price heuristic for the crew pairing problem with language constraints.
Eur. J. Oper. Res., 2020

A two-stage solution approach for personalized multi-department multi-day shift scheduling.
Eur. J. Oper. Res., 2020

Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation.
EURO J. Transp. Logist., 2020

Flight-connection Prediction for Airline Crew Scheduling to Construct Initial Clusters for OR Optimizer.
CoRR, 2020

Improving set partitioning problem solutions by zooming around an improving direction.
Ann. Oper. Res., 2020

2019
Combining Benders' Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems.
Transp. Sci., 2019

The return function: A new computable perspective on Bayesian-Nash equilibria.
Eur. J. Oper. Res., 2019

Column generation for vehicle routing problems with multiple synchronization constraints.
Eur. J. Oper. Res., 2019

A decomposition-based heuristic for large employee scheduling problems with inter-department transfers.
EURO J. Comput. Optim., 2019

2018
An implicit model for multi-activity shift scheduling problems.
J. Sched., 2018

The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints.
Eur. J. Oper. Res., 2018

Improved integral simplex using decomposition for the set partitioning problem.
EURO J. Comput. Optim., 2018

2017
Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach.
Transp. Sci., 2017

Integral simplex using decomposition with primal cutting planes.
Math. Program., 2017

Dynamic penalization of fractional directions in the integral simplex using decomposition: Application to aircrew scheduling.
Eur. J. Oper. Res., 2017

Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem.
Eur. J. Oper. Res., 2017

Dynamic constraint and variable aggregation in column generation.
Eur. J. Oper. Res., 2017

Airline crew scheduling: models, algorithms, and data sets.
EURO J. Transp. Logist., 2017

Influence of the normalization constraint on the integral simplex using decomposition.
Discret. Appl. Math., 2017

A new heuristic branching scheme for the crew pairing problem with base constraints.
Comput. Oper. Res., 2017

An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries.
Comput. Oper. Res., 2017

2016
A heuristic optimization of Bayesian incentive-compatible cake-cutting.
Comput. Oper. Res., 2016

Measuring the interactions between air traffic control and flow management using a simulation-based framework.
Comput. Ind. Eng., 2016

A dynamic constraint aggregation based solution approach for monthly aircrew pairing problem.
Proceedings of the 11th International Conference on Intelligent Systems: Theories and Applications, 2016

2015
Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis.
INFORMS J. Comput., 2015

A linear programming decomposition focusing on the span of the nondegenerate columns.
Eur. J. Oper. Res., 2015

The positive edge pricing rule for the dual simplex.
Comput. Oper. Res., 2015

A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
Integral Simplex Using Decomposition for the Set Partitioning Problem.
Oper. Res., 2014

The positive edge criterion within COIN-OR's CLP.
Comput. Oper. Res., 2014

Recoverable robust single day aircraft maintenance routing problem.
Comput. Oper. Res., 2014

Integral Simplex Using Decomposition with Primal Cuts.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013
Aircrew pairings with possible repetitions of the same flight number.
Comput. Oper. Res., 2013

2012
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation.
Transp. Sci., 2012

Assigning multiple activities to work shifts.
J. Sched., 2012

2011
An Improved Primal Simplex Algorithm for Degenerate Linear Programs.
INFORMS J. Comput., 2011

Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods.
Eur. J. Oper. Res., 2011

2010
Implicit shift scheduling with multiple breaks and work stretch duration restrictions.
J. Sched., 2010

Multi-phase dynamic constraint aggregation for set partitioning type problems.
Math. Program., 2010

Column generation decomposition with the degenerate constraints in the subproblem.
Eur. J. Oper. Res., 2010

A new version of the Improved Primal Simplex for degenerate linear programs.
Comput. Oper. Res., 2010

2009
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows.
Comput. Oper. Res., 2009

2008
Passenger Flow Model for Airline Networks.
Transp. Sci., 2008

Solution approaches to large shift scheduling problems.
RAIRO Oper. Res., 2008

Bi-dynamic constraint aggregation and subproblem reduction.
Comput. Oper. Res., 2008

2007
An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry.
Transp. Sci., 2007

Parking buses in a depot with stochastic arrival times.
Eur. J. Oper. Res., 2007

An integrated aircraft routing, crew scheduling and flight retiming model.
Comput. Oper. Res., 2007

Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches.
Comput. Oper. Res., 2007

Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap.
Ann. Oper. Res., 2007

2006
Dispatching Buses in a Depot Using Block Patterns.
Transp. Sci., 2006

Recovering an optimal LP basis from an optimal dual solution.
Oper. Res. Lett., 2006

A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem.
Oper. Res., 2006

Nodal aggregation of resource constraints in a shortest path problem.
Eur. J. Oper. Res., 2006

Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues.
Eur. J. Oper. Res., 2006

2005
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation.
Oper. Res., 2005

Bombardier Flexjet Significantly Improves Its Fractional Aircraft Ownership Operations.
Interfaces, 2005

A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem.
Comput. Oper. Res., 2005

On Compact Formulations for Integer Programs Solved by Column Generation.
Ann. Oper. Res., 2005

2004
Using Benders Decomposition to Implicitly Model Tour Scheduling.
Ann. Oper. Res., 2004

2002
VRP with Pickup and Delivery.
Proceedings of the Vehicle Routing Problem., 2002

VRP with Time Windows.
Proceedings of the Vehicle Routing Problem., 2002

2001
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling.
Transp. Sci., 2001

An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem.
Manag. Sci., 2001

Simultaneous Assignment of Locomotives and Cars to Passenger Trains.
Oper. Res., 2001

2000
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem.
Transp. Sci., 2000

Air Transat Uses ALTITUDE to Manage Its Aircraft Routing, Crew Pairing, and Work Assignment.
Interfaces, 2000

1999
2-Path Cuts for the Vehicle Routing Problem with Time Windows.
Transp. Sci., 1999

A Column Generation Approach for Large-Scale Aircrew Rostering Problems.
Oper. Res., 1999

Fleet assignment and routing with schedule synchronization constraints.
Eur. J. Oper. Res., 1999

1998
The Operational Airline Crew Scheduling Problem.
Transp. Sci., 1998

The Preferential Bidding System at Air Canada.
Transp. Sci., 1998

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs.
Networks, 1998

A Shortest Path Algorithm for a Carlike Robot in a Polygonal Environment.
Int. J. Robotics Res., 1998

Multi-depot vehicle scheduling problems with time windows and waiting costs.
Eur. J. Oper. Res., 1998

1997
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discret. Appl. Math., 1997

Maximal closure on a graph with resource constraints.
Comput. Oper. Res., 1997

A dynamic programming algorithm for single machine scheduling with ready times.
Ann. Oper. Res., 1997

1995
An efficient algorithm to find a shortest path for a car-like robot.
IEEE Trans. Robotics Autom., 1995

1994
A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem.
Oper. Res., 1994

1993
Centralized and decentralized stochastic routing models in telecommunication networks.
Telecommun. Syst., 1993

Dimensioning telephone networks with budget constraints.
Telecommun. Syst., 1993

The dynamic predicate stashing copy problem.
Networks, 1993

A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows.
Networks, 1993

A Stochastic, Multiclass Airline Network Equilibrium Model.
Oper. Res., 1993

1992
An algorithm for network dimensioning under reliability considerations.
Ann. Oper. Res., 1992

An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem.
Transp. Sci., 1991

On the evaluation of telecommunications network reliability using routing models.
IEEE Trans. Commun., 1991

1990
Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs.
Transp. Sci., 1990

1989
A Column Generation Approach to the Urban Transit Crew Scheduling Problem.
Transp. Sci., 1989

1988
Vehicle routing with full loads.
Comput. Oper. Res., 1988

1984
Routing with time windows by column generation.
Networks, 1984


  Loading...