Dr. Sevaux Marc
Research ScientistUniversity of South-Brittany, France
Highest Degree
Ph.D. in Operational Research from Pierre et Marie Curie University Paris VI, France
Share this Profile
Area of Interest:
Selected Publications
- Sousselier, T., J. Dreo and M. Sevaux, 2015. Line formation algorithm in a swarm of reactive robots constrained by underwater environment. Expert Syst. Applic., 42: 5117-5127.
CrossRef | Direct Link | - Sanchez-Oro, J., M. Sevaux, A. Rossi, R. Marti and A. Duarte, 2015. Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electron. Notes Discrete Math., 47: 85-92.
CrossRef | Direct Link | - Huber, S., M.J. Geiger and M. Sevaux, 2015. Simulation of preference information in an interactive reference point‐based method for the bi‐objective inventory routing problem. J. Multi-Criteria Decision Anal., 22: 17-35.
CrossRef | Direct Link | - Castano, F., E. Bourreau, N. Velasco, A. Rossi and M. Sevaux, 2015. Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks. Eur. J. Oper. Res., 241: 28-38.
CrossRef | Direct Link | - Sevaux, M., A. Rossi, M. Soto, A. Duarte and R. Marti, 2014. GRASP with ejection chains for the dynamic memory allocation in embedded systems. Soft Comput., 18: 1515-1527.
CrossRef | Direct Link | - Castano, F., A. Rossi, M. Sevaux and N. Velasco, 2014. A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints. Comput. Oper. Res., 52: 220-230.
CrossRef | Direct Link | - Soto, M., A. Rossi and M. Sevaux, 2013. Iterative approaches for a dynamic memory allocation problem in embedded systems. Eur. J. Oper. Res., 231: 34-42.
CrossRef | Direct Link | - Singh, A., A. Rossi and M. Sevaux, 2013. Matheuristic approaches for Q-coverage problem versions in wireless sensor networks. Eng. Optim., 45: 609-626.
CrossRef | Direct Link | - Schittekat, P., J. Kinable, K. Sorensen, M. Sevaux, F. Spieksma and J. Springael, 2013. A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res., 229: 518-528.
CrossRef | Direct Link | - Rossi, A., A. Singh and M. Sevaux, 2013. Lifetime maximization in wireless directional sensor network. Eur. J. Oper. Res., 231: 229-241.
CrossRef | Direct Link | - Soto, M., A. Rossi and M. Sevaux, 2012. A mathematical model and a metaheuristic approach for a memory allocation problem. J. Heuristics, 18: 149-167.
CrossRef | Direct Link | - Rossi, A., A. Singh and M. Sevaux, 2012. Column generation algorithm for sensor coverage scheduling under bandwidth constraints. Networks, 60: 141-154.
CrossRef | Direct Link | - Rossi, A., A. Singh and M. Sevaux, 2012. An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges. Comput. Oper. Res., 39: 3166-3176.
CrossRef | Direct Link | - Laurent, J., A. Rossi and M. Sevaux, 2012. MemExplorer: From C code to memory allocation. J. Low Power Electron., 8: 394-402.
CrossRef | Direct Link | - Soto, M., A. Rossi and M. Sevaux, 2011. Three new upper bounds on the chromatic number. Discrete Appl. Math., 159: 2281-2289.
CrossRef | Direct Link | - Sevaux, M., A. Singh and A. Rossi, 2011. Tabu search for multiprocessor scheduling: Application to high level synthesis. Asia-Pac. J. Oper. Res., 28: 201-212.
CrossRef | Direct Link | - Rossi, A., A. Singh and M. Sevaux, 2010. A metaheuristic for the fixed job scheduling problem under spread time constraints. Comput. Oper. Res., 37: 1045-1054.
CrossRef | Direct Link | - Sorensen, K. and M. Sevaux, 2009. A practical approach for robust and flexible vehicle routing using metaheuristics and monte carlo sampling. J. Math. Modell. Algorithms, 8: 387-407.
CrossRef | Direct Link | - Jouglet, A., C. Oguz and M. Sevaux, 2009. Hybrid flow-shop: A memetic algorithm using constraint-based scheduling for efficient search. J. Math. Modell. Algorithms, 8: 271-292.
CrossRef | Direct Link | - Ven, K., K. Sorensen, J. Verelst and M. Sevaux, 2008. Stimulating information sharing, collaboration and learning in operations research with libor. Int. J. Digital Libraries, 8: 79-90.
CrossRef | Direct Link | - Sevaux, M. and Y. Mineur, 2007. A curve-fitting genetic algorithm for a styling application. Eur. J. Oper. Res., 179: 895-905.
CrossRef | Direct Link | - Dullaert, W., M. Sevaux, K. Sorensen and J. Springael, 2007. Applications of metaheuristics. Eur. J. Oper. Res., 179: 601-604.
- Sorensen, K. and M. Sevaux, 2006. MA | PM: Memetic algorithms with population management. Comput. Oper. Res., 33: 1214-1225.
CrossRef | Direct Link | - Lacomme, P., C. Prins and M. Sevaux, 2006. A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res., 33: 3473-3493.
CrossRef | Direct Link | - Bouamrane, K., C. Tahon, M. Sevaux and B. Beldjilali, 2005. Decision making system for regulation of a bimodal urban transportation network, associating a classical and a multi-agent approaches. Informatica, 16: 473-502.
Direct Link | - Sevaux, M. and K. Sorensen, 2004. A genetic algorithm for robust schedules in a just-in-time environment with ready times and due dates. Q. J. Belgian French Ital. Oper. Res. Soc., 2: 129-147.
CrossRef | Direct Link | - Dauzere-Peres, S. and M. Sevaux, 2004. An exact method to minimize the number of tardy jobs in single machine scheduling. J. Scheduling, 7: 405-420.
CrossRef | Direct Link | - Sevaux, M. and S. Dauzere-Peres, 2003. Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res., 151: 296-306.
CrossRef | Direct Link | - Le Quere, Y., M. Sevaux, C. Tahon and D. Trentesaux, 2003. Reactive scheduling of complex system maintenance in a cooperative environment with communication times. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev., 33: 225-234.
CrossRef | Direct Link | - Dauzere-Peres, S. and M. Sevaux, 2003. Using lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Nav. Res. Logist., 50: 273-288.
CrossRef | Direct Link | - Dauzere-Peres, S., S.B. Gershwin and M. Sevaux, 2000. Models and solving procedures for continuous-time production planning. IIE Trans., 32: 93-103.
CrossRef | Direct Link |