The following pages link to Alain Quilliot (Q188743):
Displaying 50 items.
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← links)
- On the online min-wait relocation problem (Q324815) (← links)
- Cyclic orders (Q583246) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- (Q799694) (redirect page) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- Un problème de connectivité sur les espaces métriques (Q801084) (← links)
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- Extended cooperative networks games (Q1028468) (← links)
- An application of the Helly property to the partially ordered sets (Q1051660) (← links)
- On the Helly property working as a compactness criterion on graphs (Q1063617) (← links)
- A short note about pursuit games played on a graph with a given genus (Q1072462) (← links)
- A retraction problem in graph theory (Q1073052) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- A condition for a family of triangles to be orientable to a cyclic order (Q1182579) (← links)
- A relation between multiprocessor scheduling and linear programming (Q1267552) (← links)
- Algorithmic characterizations of interval orderd hypergraphs and applications (Q1329816) (← links)
- Compatibility between interval structures and partial orderings (Q1331978) (← links)
- On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties (Q1584455) (← links)
- Empirical analysis for the VRPTW with a multigraph representation for the road network (Q1651529) (← links)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- Anchored reactive and proactive solutions to the CPM-scheduling problem (Q1753557) (← links)
- Some results about pursuit games on metric spaces obtained through graph theory techniques (Q1821043) (← links)
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
- Linear time algorithms on mirror trees (Q2091108) (← links)
- The parallel drone scheduling problem with multiple drones and vehicles (Q2116866) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines (Q2446341) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
- Operative games and elastic demands. (Q2731654) (← links)
- Multiple routing strategies in a labelled network (Q2765602) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- A parametric scheme for online uniform-machine scheduling to minimize the makespan (Q2833437) (← links)
- Tree based heuristics for the preemptive asymmetric stacker crane problem (Q2883548) (← links)
- Prospective network flow models and algorithms for bin packing problems (Q2883549) (← links)
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
- (Q3061964) (← links)
- (Q3061965) (← links)
- Linear Arrangement Problems and Interval Graphs (Q3195345) (← links)
