The following pages link to Marc Sevaux (Q299775):
Displaying 37 items.
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks (Q299776) (← links)
- Robust scheduling of wireless sensor networks for target tracking under uncertainty (Q322906) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges (Q339664) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- An exact approach to extend network lifetime in a general class of wireless sensor networks (Q781952) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- A curve-fitting genetic algorithm for a styling application (Q864005) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
- Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates (Q1885338) (← links)
- A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics'' (Q2002856) (← links)
- Planning a multi-sensors search for a moving target considering traveling costs (Q2030597) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- Integrating preferences within multiobjective flexible job shop scheduling (Q2103005) (← links)
- Robust scheduling for target tracking using wireless sensor networks (Q2289953) (← links)
- Iterative approaches for a dynamic memory allocation problem in embedded systems (Q2356204) (← links)
- An exact method to minimize the number of tardy jobs in single machine scheduling (Q2464432) (← links)
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
- A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← links)
- Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks (Q2668762) (← links)
- TABU SEARCH FOR MULTIPROCESSOR SCHEDULING: APPLICATION TO HIGH LEVEL SYNTHESIS (Q2998843) (← links)
- The Biobjective Inventory Routing Problem – Problem Solution and Decision Support (Q3091520) (← links)
- On the Cover Scheduling Problem in Wireless Sensor Networks (Q3091546) (← links)
- (Q3367362) (← links)
- A Robust-Solution-Based Methodology to Solve Multiple-Objective Problems with Uncertainty (Q3649610) (← links)
- (Q4424327) (← links)
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721) (← links)
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints (Q5326765) (← links)
- Comments on: ``Tabu search tutorial. A graph drawing application'' (Q5970665) (← links)
- Efficient configuration of heterogeneous multistatic sonar networks: a mixed-integer linear programming approach (Q6568448) (← links)
- Colour Palettes for Digital Elevation Models (Q6701670) (← links)
- Catalogue of Coastal-Based Instances (Q6701672) (← links)
