default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Houssin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Idir Hamaz, Laurent Houssin
, Sonia Cafieri:
The robust cyclic job shop problem. Eur. J. Oper. Res. 312(3): 855-865 (2024)- 2023
- [j11]Carla Juvin, Laurent Houssin, Pierre Lopez:
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem. Comput. Oper. Res. 152: 106156 (2023) - [j10]Imane Oussakel, Philippe Owezarski, Pascal Berthou, Laurent Houssin:
Toward Radio Access Network Slicing Enforcement in Multi-cell 5G System. J. Netw. Syst. Manag. 31(1): 8 (2023) - [c12]Carla Juvin, Emmanuel Hebrard, Laurent Houssin, Pierre Lopez:
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. CP 2023: 19:1-19:16 - [c11]Carla Juvin, Laurent Houssin, Pierre Lopez:
Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty. CPAIOR 2023: 354-369 - [c10]Carla Juvin, Laurent Houssin, Pierre Lopez:
Hybrid Methods to Solve the Two-Stage Robust Flexible Job-Shop Scheduling Problem with Budgeted Uncertainty. ICORES 2023: 135-142 - 2022
- [b1]Laurent Houssin:
Optimisation pour l'ordonnancement et le spatial. (Optimization for scheduling problems and space technology problems). Paul Sabatier University, Toulouse, France, 2022 - [j9]Aloïs Duguet, Christian Artigues, Laurent Houssin, Sandra Ulrich Ngueveu:
Properties, Extensions and Application of Piecewise Linearization for Euclidean Norm Optimization in $\mathbb {R}^2$. J. Optim. Theory Appl. 195(2): 418-448 (2022) - 2021
- [j8]Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues:
MILP formulation improvement with k-means clustering for the beam layout optimization in multibeam satellite systems. Comput. Ind. Eng. 158: 107228 (2021) - 2020
- [j7]Felix Quinton, Idir Hamaz, Laurent Houssin:
A mixed integer linear programming modelling for the flexible cyclic jobshop problem. Ann. Oper. Res. 285(1): 335-352 (2020)
2010 – 2019
- 2019
- [j6]Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues:
Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design. Comput. Optim. Appl. 73(2): 679-705 (2019) - 2018
- [j5]Idir Hamaz, Laurent Houssin, Sonia Cafieri:
A robust basic cyclic scheduling problem. EURO J. Comput. Optim. 6(3): 291-313 (2018) - [c9]Felix Quinton, Idir Hamaz, Laurent Houssin:
Algorithms for the flexible cyclic jobshop problem. CASE 2018: 945-950 - [c8]Idir Hamaz, Laurent Houssin, Sonia Cafieri:
A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem. ISCO 2018: 228-240 - 2016
- [c7]Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues:
Mixed-integer linear programming for multibeam satellite systems design: Application to the beam layout optimization. SysCon 2016: 1-6 - 2015
- [c6]Laurent Houssin:
An exension of the heap of pieces model for the Cyclic Jobshop Problem. CASE 2015: 1182-1187 - [c5]Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues:
A Comparison of a Global Approach and a Decomposition Method for Frequency Assignment in Multibeam Satellite Systems. ICORES (Selected Papers) 2015: 21-39 - [c4]Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues:
A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems . ICORES 2015: 23-33 - 2014
- [c3]Jean-Thomas Camino, Stéphane Mourgues, Christian Artigues, Laurent Houssin:
A greedy approach combined with graph coloring for non-uniform beam layouts under antenna constraints in multibeam satellite systems. ASMS/SPSC 2014: 374-381 - 2013
- [j4]Kata Kiatmanaroj, Christian Artigues, Laurent Houssin, Frédéric Messine:
Frequency assignment in a SDMA satellite communication system with beam decentring feature. Comput. Optim. Appl. 56(2): 439-455 (2013) - [j3]Laurent Houssin, Sébastien Lahaye, Jean-Louis Boimond:
Control of (max, +)-linear systems minimizing delays. Discret. Event Dyn. Syst. 23(3): 261-276 (2013) - 2012
- [c2]Kata Kiatmanaroj, Christian Artigues, Laurent Houssin, Frédéric Messine:
Frequency allocation in a SDMA satellite communication system with beam moving. ICC 2012: 3265-3269 - 2011
- [j2]Laurent Houssin, Christian Artigues, Erwan Corbel:
Frequency allocation problem in a SDMA satellite communication system. Comput. Ind. Eng. 61(2): 346-351 (2011)
2000 – 2009
- 2007
- [j1]Laurent Houssin, Sébastien Lahaye, Jean-Louis Boimond:
Just in Time Control of Constrained ( max , +)-Linear Systems. Discret. Event Dyn. Syst. 17(2): 159-178 (2007) - 2003
- [c1]Sébastien Lahaye, Laurent Houssin, Jean-Louis Boimond:
Modelling of Urban Bus Networks in Dioids Algebra. POSTA 2003: 23-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
