92 citations
- Centre National de la Recherche ScientifiqueFR17 papers
- Institut polytechnique de GrenobleFR12 papers
- Université Grenoble AlpesFR12 papers
- Lattice Government Services (United States)US5 papers
- Décision et Information pour les Systèmes de ProductionFR4 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- Université Côte d'AzurFR2 papers
- Aix-Marseille UniversitéFR1 paper
- Amrita Vishwa VidyapeethamIN1 paper
- Andritz (Austria)AT1 paper
- City, University of LondonGB1 paper
- Columbia UniversityUS1 paper
8 papers · 1 filter
Tree search algorithms for the Sequential Ordering Problem
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard +1
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algor…
Analysis of the co-design activity: influence of a mixed artifact and contribution of the gestural function in a spatial augmented reality environment
Maud Poulin, Jean-François Boujut, Cédric Masclet
Augmented reality provides new possibilities to propose environments where the designers can take advantage of the physicality of the artifacts while keeping the versatility of dig…
Knowledge and skills requirements for the software design and testing of automotive applications
Jernej Zabavnik, Andreas Riel, M. Margu{č} +1
The required knowledge and skills that should be provided to the novice developer, designing and testing the safety critical device in automotive industry using Hardware-in-the-Loo…
Color-critical Graphs and Hereditary Hypergraphs
András Sebő
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-…
A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications
Arnaud Malapert, Margaux Nattaf
This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family…
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected span…