Alain Quilliot

Orcid: 0000-0002-6879-5669

Affiliations:
  • LIMOS, UMR CNRS, ISIMA, Campus des Cézeaux, Aubière Cedex, France


According to our database1, Alain Quilliot authored at least 142 papers between 1983 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A project and lift approach for a 2-commodity flow relocation model in a time expanded network.
Discret. Appl. Math., 2024

Approximation algorithms for Job Scheduling with reconfigurable resources.
CoRR, 2024

Approximation Algorithm for Job Scheduling with Reconfigurable Resources.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Surrogate Constraints for Synchronized Energy Production/Consumption.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

A Guided Insertion Mechanism for Solving the Dynamic Large-Scale Dial-a-Ride Problem.
Proceedings of the 11th International Network Optimization Conference, 2024

Handling Lot Sizing/Job Scheduling Synchronization through Path Search Algorithms.
Proceedings of the Communication Papers of the 19th Conference on Computer Science and Intelligence Systems, 2024

2023
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint.
4OR, June, 2023

Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers.
SN Comput. Sci., 2023

Pickup and Delivery Problem with Cooperative Robots.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Synchronising Lot Sizing and Job Scheduling.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

A Filtering System for the Large-Scale Dial-A-Ride Problem With Shared Autonomous Vehicles.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Managing a Time Expanded Network through Project-and-Lift.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Managing Time Expanded Networks through Project and Lift: the Lift Issue.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Multiple Heuristics with Reinforcement Learning to Solve the Safe Shortest Path Problem in a Warehouse.
Proceedings of the Operations Research and Enterprise Systems, 2023

A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem.
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

Synchronizing Vehicle Routing and Photo-Voltaic Production.
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

Algorithmic Handling of Time Expanded Networks.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

A Rubber Tyred Gantry Crane Scheduling in Container Terminals in Port of Sfax-Tunisia.
Proceedings of the 9th International Conference on Control, 2023

An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints.
Proceedings of the 9th International Conference on Control, 2023

2022
Linear time algorithms on mirror trees.
J. Comb. Optim., 2022

Pickup and delivery problems with autonomous vehicles on rings.
Eur. J. Oper. Res., 2022

The parallel drone scheduling problem with multiple drones and vehicles.
Eur. J. Oper. Res., 2022

Surrogate Estimators for Complex Bi-level Energy Management.
Proceedings of the Recent Advances in Computational Optimization - Selected Papers from the WCO 2022, 2022

Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Searching for a Safe Shortest Path in a Warehouse.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

Safe Management of Autonomous Vehicles.
Proceedings of the 8th International Conference on Control, 2022

A Synchronized Knapsack Problem.
Proceedings of the 8th International Conference on Control, 2022

2021
Pipe-lining dynamic programming processes to synchronize both the production and the consumption of energy.
RAIRO Oper. Res., 2021

Synchronizing energy production and vehicle routing.
RAIRO Oper. Res., 2021

The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information.
Oper. Res. Forum, 2021

Flexible multi-unmanned ground vehicles (MUGVs) in intersection coordination based on ε-constraint probability collectives algorithm.
Int. J. Intell. Robotics Appl., 2021

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation.
Eur. J. Oper. Res., 2021

The Steiner bi-objective shortest path problem.
EURO J. Comput. Optim., 2021

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines.
Comput. Oper. Res., 2021

Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system.
Ann. Oper. Res., 2021

Intelligent Traffic Based on Hybrid Control Policy of Connected Autonomous Vehicles in Multiple Unsignalized Intersections.
Proceedings of the 2021 IEEE SmartWorld, 2021

Hierarchical Control for Trajectory-based Intelligent Navigation in Urban Adjacent Intersections.
Proceedings of the 24th IEEE International Intelligent Transportation Systems Conference, 2021

Multi-Mode RCPSP with Safety Margin Maximization: Models and Algorithms.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

Algorithms for the Safe Management of Autonomous Vehicles.
Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

2020
Pipe-lining Dynamic Programming Processes in Order to Synchronize Energy Production and Consumption.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Dynamic Programming for the Synchronization of Energy Production and Consumption Processes.
Proceedings of the Recent Advances in Computational Optimization, 2020

Simultaneous Management of Energy Production and Consumption.
Proceedings of the 7th International Conference on Control, 2020

2019
Fleet management for autonomous vehicles: Online PDP under special constraints.
RAIRO Oper. Res., 2019

Bi-criteria path problem with minimum length and maximum survival probability.
OR Spectr., 2019

A branch-and-price algorithm for the vehicle routing problem with time windows on a road network.
Networks, 2019

Integration of routing into a resource-constrained project scheduling problem.
EURO J. Comput. Optim., 2019

Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows.
Comput. Oper. Res., 2019

Models and Algorithms for Natural Disaster Evacuation Problems.
Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

Layered Network Oriented Approaches for Vehicle Relocation Problems.
Proceedings of the 6th International Conference on Control, 2019

No-idle Parallel Machine Scheduling of Unit-time Jobs.
Proceedings of the 6th International Conference on Control, 2019

2018
Lower and upper bounds for the linear arrangement problem on interval graphs.
RAIRO Oper. Res., 2018

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP.
RAIRO Oper. Res., 2018

Vehicle routing problems with road-network information: State of the art.
Networks, 2018

An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem.
Networks, 2018

General parametric scheme for the online uniform machine scheduling problem with two different speeds.
Inf. Process. Lett., 2018

Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product.
Int. J. Prod. Res., 2018

A Dial-a-Ride evaluation for solving the job-shop with routing considerations.
Eng. Appl. Artif. Intell., 2018

A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines.
Discret. Appl. Math., 2018

Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017
Knapsack problem with objective value gaps.
Optim. Lett., 2017

Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehicles.
Eur. J. Oper. Res., 2017

Anchored reactive and proactive solutions to the CPM-scheduling problem.
Eur. J. Oper. Res., 2017

Fleet management for autonomous vehicles using flows in time-expanded networks.
Electron. Notes Discret. Math., 2017

A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution.
Eng. Appl. Artif. Intell., 2017

Empirical analysis for the VRPTW with a multigraph representation for the road network.
Comput. Oper. Res., 2017

Vehicle Oriented Algorithms for the Relocation of Vehicle Sharing Systems.
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

Heuristics and approximation results for vehicle sharing problems.
Proceedings of the 4th International Conference on Control, 2017

2016
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs.
RAIRO Oper. Res., 2016

Agents endowed with uncertainty management behaviors to solve a multiskill healthcare task scheduling.
J. Biomed. Informatics, 2016

Fleet management for autonomous vehicles.
CoRR, 2016

Facility Location Models for Vehicle Sharing Systems.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

PDP/Assignment decomposition of vehicle sharing problems.
Proceedings of the International Conference on Control, 2016

2015
An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration.
Eur. J. Oper. Res., 2015

On the Online Min-Wait Relocation Problem.
Electron. Notes Discret. Math., 2015

Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems.
CoRR, 2015

ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem.
CoRR, 2015

Health Care Decision Support System for the Pediatric Emeregency Department Management.
Proceedings of the MEDINFO 2015: eHealth-enabled Health, 2015

Coloring Interval Graphs while Minimizing End-Point Number.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

An Assignment Problem with Compactness Requirements: Models and Algorithms.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Fleet management of autonomous vehicles: VIPAFLEET.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Partial Enumeration of Minimal Transversals of a Hypergraph.
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

2014
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Linear Arrangement Problems and Interval Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Exact and Approximation Algorithms for Linear Arrangement Problems.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

Routing on Dynamic Networks: GRASP versus Genetic.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem.
Proceedings of the International Conference on Control, 2014

Branch and Price for a reliability oriented DARP model.
Proceedings of the International Conference on Control, 2014

2013
Flow Models for Project Scheduling with Transfer Delays and Financial Constraints.
Proceedings of the Recent Advances in Computational Optimization, 2013

Homogeneous Non Idling Problems: Models and Algorithms.
Proceedings of the Recent Advances in Computational Optimization, 2013

Constraint Propagation for the Dial-a-Ride Problem with Split Loads.
Proceedings of the Recent Advances in Computational Optimization, 2013

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities.
RAIRO Oper. Res., 2013

Models and Algorithms for Carsharing Systems and Related Problems.
Electron. Notes Discret. Math., 2013

Homogeneously non-idling schedules of unit-time jobs on identical parallel machines.
Discret. Appl. Math., 2013

A Multi-Machine Scheduling Problem with Global Non Idling Constraint.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Dial-A-Ride Problem with Time Windows, Transshipments, and Dynamic Transfer Points.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Scale Multi-commodity Flow Handling on Dynamic Networks.
Proceedings of the Large-Scale Scientific Computing - 9th International Conference, 2013

Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs.
Proceedings of the Recent Advances in Computational Optimization, 2013

Branch and Price for Preemptive Resource Constrained Project Scheduling Problem Based on Interval Orders in Precedence Graphs.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Robustness Tools in Dynamic Dial-a-Ride Problems.
Proceedings of the Recent Advances in Computational Optimization, 2013

Anticipation in the Dial-a-Ride Problem: an introduction to the robustness.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Approximation results for the linear ordering problem on interval graphs.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Flow Polyhedra and Resource Constrained Project Scheduling Problems.
RAIRO Oper. Res., 2012

Flow Models for Project Scheduling with Transfer Delays.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

The Hogeneous Non Idling Scheduling Problem.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Insertion techniques and constraint propagation for the DARP.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Lagrangean decomposition of a lot-sizing problem into facility location and multicommodity flow..
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.
RAIRO Oper. Res., 2011

A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem.
Comput. Oper. Res., 2011

Security architecture for wireless sensor networks using frequency hopping and public key management.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2011

The integrated lot-sizing and vehicle routing problem.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2010
Editorial. The MODE/ROADEF 2008 Conference.
RAIRO Oper. Res., 2010

Prospective Network Flow Models and Algorithms for Bin Packing Problems.
Electron. Notes Discret. Math., 2010

Tree based heuristics for the preemptive asymmetric stacker crane problem.
Electron. Notes Discret. Math., 2010

2009
Extended cooperative networks games.
Discret. Appl. Math., 2009

2008
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results.
RAIRO Oper. Res., 2008

Preemptive scheduling and antichain polyhedra.
Discret. Appl. Math., 2008

2007
Cooperative networks games with elastic demands.
RAIRO Oper. Res., 2007

Linear programming based algorithms for preemptive and non-preemptive RCPSP.
Eur. J. Oper. Res., 2007

2005
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité.
RAIRO Oper. Res., 2005

Optimal preemptive scheduling on a fixed number of identical parallel machines.
Oper. Res. Lett., 2005

2001
Convexity and global optimization: a theoretical link.
Theor. Comput. Sci., 2001

Multiple Routing Strategies in a Labelled Network.
RAIRO Oper. Res., 2001

Tarification par des jeux Coopératifs avec Demandes Élastiques.
RAIRO Oper. Res., 2001

2000
Coeur et nucléolus des jeux de recouvrement.
RAIRO Oper. Res., 2000

1998
On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties.
Discret. Math., 1998

Scheduling with Communication Delays and Data Routing in Message Passing Architectures.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1994
Compatibilité entre structures d'intervalles et relations d'orde.
Discret. Math., 1994

Algorithmic Characterizations of Interval ordered Hypergraphs and Applications.
Discret. Appl. Math., 1994

1993
Une extension du problème du point fixe pour des graphes simples.
Discret. Math., 1993

1992
A Backward Chaining Resolution Process Involving Non-Monotonic Operators.
Proceedings of the IPMU '92, 1992

1991
Une condition pour qu'une famille de triangles soit orientable en un ordre cyclique.
Discret. Math., 1991

1989
Cyclic Orders.
Eur. J. Comb., 1989

1988
On the problem of how to represent a graph taking into account an additional structure.
J. Comb. Theory B, 1988

1986
Some Results about Pursuit Games on Metric Spaces Obtained Through Graph Theory Techniques.
Eur. J. Comb., 1986

1985
A short note about pursuit games played on a graph with a given genus.
J. Comb. Theory B, 1985

On the Helly Property Working as a Compactness Criterion on Graphs.
J. Comb. Theory A, 1985

A retraction problem in graph theory.
Discret. Math., 1985

Representation theorems for graphs whose the vertex set is partially ordered.
Discret. Math., 1985

1984
Un Problème de Connectivité sur les Espaces Métriques.
Eur. J. Comb., 1984

Circular representation problem on hypergraphs.
Discret. Math., 1984

1983
An Application of the Helly Property to the Partially Ordered Sets.
J. Comb. Theory A, 1983


  Loading...