Special issue on bilevel optimization

QR Code

Special issue on bilevel optimization

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Luce Brotcorne, Bernard Fortz, Martine Labbé
Format:	article
Langue:	EN
Publié:	Elsevier 2020
Sujets:	Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Accès en ligne:	https://doaj.org/article/265672eceaff4394b80d43be52500d4d
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Special issue on “Applied bilevel programming”
par: Patrice Marcotte, et autres
Publié: (2015)

Special issue on: robust combinatorial optimization
par: Arie M.C.A. Koster, et autres
Publié: (2018)

SI on computational methods for network optimization problems
par: Bernard Fortz, et autres
Publié: (2013)

Special issue on “Non-linear continuous optimization”
par: Regina S. Burachik, et autres
Publié: (2016)

Special issue on: Nonlinear and combinatorial methods for energy optimization
par: Claudia D’Ambrosio, et autres
Publié: (2017)

Special issue on: constraint programming approaches to combinatorial optimization
par: Louis-Martin Rousseau, et autres
Publié: (2014)

Special issue on: “matheuristics”
par: Claudia Archetti, et autres
Publié: (2014)

Editorial
par: Bernard Fortz, et autres
Publié: (2016)

Real-time algorithms for the bilevel double-deck elevator dispatching problem
par: Janne Sorsa
Publié: (2019)

Editorial
par: Martine Labbé, et autres
Publié: (2013)

Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
par: Mario Levorato, et autres
Publié: (2017)

SI: disaster risk management
par: Marc Goerigk, et autres
Publié: (2016)

Lagrangian decompositions for the two-level FTTx network design problem
par: Andreas Bley, et autres
Publié: (2013)

Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
par: W.e.i. Jiang, et autres
Publié: (2020)

Special issue on: Computational discrete optimization
par: ArieM.C.A. Koster, et autres
Publié: (2020)

Robust balanced optimization
par: AnnetteM.C. Ficker, et autres
Publié: (2018)

Multipolar robust optimization
par: Walid Ben-Ameur, et autres
Publié: (2018)

Portfolio optimization with pw-robustness
par: Virginie Gabrel, et autres
Publié: (2018)

Computing Euclidean Steiner trees over segments
par: Ernst Althaus, et autres
Publié: (2020)

Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
par: Jannis Kurtz
Publié: (2018)

Robust combinatorial optimization under convex and discrete cost uncertainty
par: Christoph Buchheim, et autres
Publié: (2018)

A distributionally robust optimization approach for two-stage facility location problems
par: Arash Gourtani, et autres
Publié: (2020)

A constraint programming primer
par: Gilles Pesant
Publié: (2014)

Global resolution of the support vector machine regression parameters selection problem with LPCC
par: Yu-Ching Lee, et autres
Publié: (2015)

A survey on matheuristics for routing problems
par: Claudia Archetti, et autres
Publié: (2014)

A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
par: Dalia Attia, et autres
Publié: (2019)

Generalized minimum spanning tree games
par: PhuocHoang Le, et autres
Publié: (2016)

Models for video-on-demand scheduling with costs
par: J.-Ch. Grégoire, et autres
Publié: (2016)

A multi-period shelter location-allocation model with evacuation orders for flood disasters
par: Melissa Gama, et autres
Publié: (2016)

Another pedagogy for mixed-integer Gomory
par: Jon Lee, et autres
Publié: (2017)

CP methods for scheduling and routing with time-dependent task costs
par: Elena Kelareva, et autres
Publié: (2014)

A Lagrangian-ACO matheuristic for car sequencing
par: Dhananjay Thiruvady, et autres
Publié: (2014)

Integration of routing into a resource-constrained project scheduling problem
par: Philippe Lacomme, et autres
Publié: (2019)

A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
par: Anjulika Gupta, et autres
Publié: (2018)

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
par: CláudioP. Santiago, et autres
Publié: (2019)

Bilevel programming for price-based electricity auctions: a revenue-constrained case
par: Ricardo Fernández-Blanco, et autres
Publié: (2015)

Open problems on graph eigenvalues studied with AutoGraphiX
par: Mustapha Aouchiche, et autres
Publié: (2013)

Alternative SDP and SOCP approximations for polynomial optimization
par: Xiaolong Kuang, et autres
Publié: (2019)

A bounded degree SOS hierarchy for polynomial optimization
par: JeanB. Lasserre, et autres
Publié: (2017)

Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
par: Jens Poppenborg, et autres
Publié: (2016)