default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGérard Plateau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j17]Franck Butelle, Laurent Alfandari, Camille Coti
, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo:
Fast machine reassignment. Ann. Oper. Res. 242(1): 133-160 (2016)- 2012
- [j16]Lucas Létocart, Anass Nagih, Gérard Plateau:
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. Comput. Oper. Res. 39(1): 12-18 (2012) - 2011
- [j15]Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau:
A MIP flow model for crop-rotation planning in a context of forest sustainable development. Ann. Oper. Res. 190(1): 149-164 (2011) - 2006
- [j14]Babacar Thiongane, Anass Nagih, Gérard Plateau:
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem. Discret. Appl. Math. 154(15): 2200-2211 (2006) - [j13]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models. Manag. Sci. 52(9): 1450-1455 (2006) - 2005
- [j12]Babacar Thiongane, Anass Nagih, Gérard Plateau:
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual. Ann. Oper. Res. 139(1): 353-373 (2005) - [j11]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Ann. Oper. Res. 140(1): 49-65 (2005) - 2004
- [j10]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
Telecommunication Network Capacity Design for Uncertain Demand. Comput. Optim. Appl. 29(2): 127-146 (2004) - 2003
- [j9]Babacar Thiongane, Anass Nagih, Gérard Plateau:
Analyse de sensibilité pour les problèmes linéaires en variables 0-1. RAIRO Oper. Res. 37(4): 291-309 (2003) - 1999
- [j8]Anass Nagih, Gérard Plateau:
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. RAIRO Oper. Res. 33(4): 383-419 (1999) - 1998
- [j7]Hachemi Bennaceur, Idir Gouachi, Gérard Plateau:
An Incremental Branch-and-Bound Method for the Satisfiability Problem. INFORMS J. Comput. 10(3): 301-308 (1998) - 1996
- [j6]Arnaud Fréville, Gérard Plateau:
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool. J. Heuristics 2(2): 147-167 (1996) - 1994
- [j5]Didier Fayard, Gérard Plateau:
An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem. Discret. Appl. Math. 49(1-3): 175-187 (1994) - [j4]Arnaud Fréville, Gérard Plateau:
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem. Discret. Appl. Math. 49(1-3): 189-212 (1994) - 1993
- [j3]Hachemi Bennaceur, Gérard Plateau:
An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference. Inf. Process. Lett. 48(3): 151-158 (1993) - 1982
- [j2]Didier Fayard, Gérard Plateau:
An algorithm for the solution of the 0-1 knapsack problem. Computing 28(3): 269-287 (1982) - 1975
- [j1]Didier Fayard, Gérard Plateau:
Resolution of the 0-1 knapsack problem: Comparison of methods. Math. Program. 8(1): 272-307 (1975)
Conference and Workshop Papers
- 1991
- [c1]Hachemi Bennaceur, Gérard Plateau:
Theorem Proving by Combinatorial Optimization. IWWERT 1991: 90-102
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-05-08 21:51 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:
