Polyhedra are used in verification and automatic parallelization to capture linear relations between variables. A polyhedron can be represented as constraints, generators or both in the double description framework. Whatever the representation, most polyhedral operators spend a significant amount of time to maintain minimal representations. To mini...
In the Spy game, a spy is placed first at some vertex of a graph G. Then, k > 0 guards are also occupying some vertices of G. At each turn, the spy moves at speed s ≥ 2, i.e., along at most s edges and then, each guard moves at speed 1. The spy and any number of guards may occupy the same vertex. The goal of the guards is to control the spy at dist...
This research focuses on designing transportation plan for SNCF Transilien (French rail-way operator for the Parisian suburban mass transit). The objective is to develop methods and decision support tools to propose a timetable adapted to the passenger demand in the Parisian mass transit system, including comfort and reliability criterias.
This pape...
The location of facilities, as part of a supply chain design, is considered a decision of strategic type, commitment resources in the long term and generally not flexible. It is an external factor affecting the competitiveness of agriculture at meso and micro levels, which has a significant impact on the costs of transporting and processing of the ...
ABSTRACT This paper deals with a problem that Information Technology outsourcing suppliers generally face when selecting a working team technically capable for specific roles in software development projects. A combination of methodologies, interactively integrated, is proposed. They are Soft System Methodology to structure the problem, Repertory G...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated with non-negative coefficients, constants, and variables. Notable special cases of positive LPs include packing LPs and covering LPs. Positive LPs model a wide range of fundamental problems both in theory of computation as well as in practice, thus h...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated with non-negative coefficients, constants, and variables. Notable special cases of positive LPs include packing LPs and covering LPs. Positive LPs model a wide range of fundamental problems both in theory of computation as well as in practice, thus h...
This report presents an approach on how to utilize information on future states of traffic lights to reduce the energy consumption and trip time for a Heavy Duty Vehicle. Model Predictive Control is proposed as a solution to handle the optimisation on-line and the concept is tested for various prediction horizons in which information can be receive...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is strictly greater than 2. The Minimum Branch Vertices Spanning Tree problem (MBVST) consists in finding a spanning tree of G with the minimum number of branch vertices. This problem has been well studied in the literature and has applications specially for rout...
Published in Open Engineering
The issue of operative data reception on location and movement of railcars is significant the constantly growing requirements of the provision of timely and safe transportation. The technical solution for efficiency improvement of data collection on rail rolling stock is the implementation of an identification system. Nowadays, there are several su...
