-
An Efficient Algorithm for the Knapsack Sharing Problem
Knapsack Sharing Problem (KSP) is an NP-Hard combinatorial optimization problem, admitted in numerous real world applications. In the KSP, we have a knapsack of... -
From plant to human via parasitic wasps: how to decide without calculating?
The aim of this thesis is to understand how organisms such as clonal plants, humans or insect parasitoids solve a common issue: How to behave in a heterogeneous... -
Heuristics for Bandwidth Reservation in Multihop Wireless Networks
We propose three heuristics to compute QoS routes in a multihop wireless networks considering interferences constraints. It has been proved that reservation under such... -
Just-in-time changeover cost minimization problem : Dynamic programming appro...
The problem studied in this paper originates from a just-in-time environment where a new supplying mode, called Synchronous Delivery, has been introduced recently. We... -
Care-Trajectory optimization in radiotherapy and hadrontherapy facilities
Ionizing therapy treatment scheduling optimization can improve both patients’ care and care structures’ efficiency. Despite its complexity, mainly because of scarce... -
Integrated Scheduling of Production and Transportation Operations with Stage-...
Increasing global competition in the business world and heightened expectations of customers have forced companies to consider not only the pricing or product quality,... -
Evolutionary Approach for the Containers Bin-Packing Problem
International audience -
Lightpath assignment for multifibers wdm optical networks with wavelength tra...
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators.... -
Complexity Results on Election of Multipoint Relays in Wireless Networks
The election of multipoint relays allows to decrease the cost of broadcasting in wireless networks. For each source, the fewer elements the set has, the greater the... -
Separating Topology and Geometry in Space Planning
International audience -
New heuristics for two bounded-degree spanning tree problems
International audience -
Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders
Comparative genomics is an important tool to better understand the different between species. Several methods exist to compare two genomes such that the computation of... -
Defeating phishing and pharming attacks at the client-side
The development of online transactions and "always-connected" broadband Internet access is a great improvement for Internet users, who can now benefit from easy access... -
Virtual Topology Reconfiguration Issues in Evolution of WDM Optical Networks
We consider the reconfiguration problem in multi-fiber WDM optical networks. In a real-time network as the traffic evolves with time: the virtual topology may not... -
Exact and heuristic appoaches for solving multi-parts cyclic hoist scheldulin...
In this thesis, we study the Cyclic Hoist Scheduling Problem (CHSP) in automated electroplating lines, when a mass production must be achieved. The CHSP is... -
Optimal Determination of Common Operators for Multi-Standards Software-Define...
International audience -
Multi-products Location-Routing problem with Pickup and Delivery
International audience -
All-Optical Multicast Routing Algorithms without Splitters
Multicasting in WDM core networks is an efficient way to economize network resources for several multimedia applications. Due to their complexity and cost, multicast... -
Multicast Routing in WDM Networks without Splitters
International audience -
Lower and upper bounds for a two-stage capacitated facility location problem ...
International audience
