Special issue on: constraint programming approaches to combinatorial optimization

Código QR

Special issue on: constraint programming approaches to combinatorial optimization

Guardado en:

Detalles Bibliográficos
Autores principales:	Louis-Martin Rousseau, Willem-Janvan Hoeve
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2014
Materias:	Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/ecd88d9214fb438da56e573518f9a652
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Special issue on: robust combinatorial optimization
por: Arie M.C.A. Koster, et al.
Publicado: (2018)

Special issue on: Nonlinear and combinatorial methods for energy optimization
por: Claudia D’Ambrosio, et al.
Publicado: (2017)

Special issue on “Applied bilevel programming”
por: Patrice Marcotte, et al.
Publicado: (2015)

Special issue on: “matheuristics”
por: Claudia Archetti, et al.
Publicado: (2014)

Special issue on bilevel optimization
por: Luce Brotcorne, et al.
Publicado: (2020)

Special issue on “Non-linear continuous optimization”
por: Regina S. Burachik, et al.
Publicado: (2016)

A constraint programming primer
por: Gilles Pesant
Publicado: (2014)

Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
por: Jannis Kurtz
Publicado: (2018)

Robust combinatorial optimization under convex and discrete cost uncertainty
por: Christoph Buchheim, et al.
Publicado: (2018)

Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
por: Mario Levorato, et al.
Publicado: (2017)

SI on computational methods for network optimization problems
por: Bernard Fortz, et al.
Publicado: (2013)

SI: disaster risk management
por: Marc Goerigk, et al.
Publicado: (2016)

Lagrangian decompositions for the two-level FTTx network design problem
por: Andreas Bley, et al.
Publicado: (2013)

Editorial
por: Martine Labbé, et al.
Publicado: (2013)

Editorial
por: Bernard Fortz, et al.
Publicado: (2016)

Computing Euclidean Steiner trees over segments
por: Ernst Althaus, et al.
Publicado: (2020)

Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
por: W.e.i. Jiang, et al.
Publicado: (2020)

Special issue on: Computational discrete optimization
por: ArieM.C.A. Koster, et al.
Publicado: (2020)

Robust balanced optimization
por: AnnetteM.C. Ficker, et al.
Publicado: (2018)

Global resolution of the support vector machine regression parameters selection problem with LPCC
por: Yu-Ching Lee, et al.
Publicado: (2015)

Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018)

A survey on matheuristics for routing problems
por: Claudia Archetti, et al.
Publicado: (2014)

A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
por: Dalia Attia, et al.
Publicado: (2019)

Generalized minimum spanning tree games
por: PhuocHoang Le, et al.
Publicado: (2016)

Multipolar robust optimization
por: Walid Ben-Ameur, et al.
Publicado: (2018)

Real-time algorithms for the bilevel double-deck elevator dispatching problem
por: Janne Sorsa
Publicado: (2019)

Models for video-on-demand scheduling with costs
por: J.-Ch. Grégoire, et al.
Publicado: (2016)

A multi-period shelter location-allocation model with evacuation orders for flood disasters
por: Melissa Gama, et al.
Publicado: (2016)

Another pedagogy for mixed-integer Gomory
por: Jon Lee, et al.
Publicado: (2017)

A distributionally robust optimization approach for two-stage facility location problems
por: Arash Gourtani, et al.
Publicado: (2020)

CP methods for scheduling and routing with time-dependent task costs
por: Elena Kelareva, et al.
Publicado: (2014)

A Lagrangian-ACO matheuristic for car sequencing
por: Dhananjay Thiruvady, et al.
Publicado: (2014)

Integration of routing into a resource-constrained project scheduling problem
por: Philippe Lacomme, et al.
Publicado: (2019)

A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
por: Anjulika Gupta, et al.
Publicado: (2018)

Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
por: Pierre Schaus, et al.
Publicado: (2014)

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

A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017)

Open problems on graph eigenvalues studied with AutoGraphiX
por: Mustapha Aouchiche, et al.
Publicado: (2013)

On conditional cuts for stochastic dual dynamic programming
por: W. van Ackooij, et al.
Publicado: (2020)

Restrict-and-relax search for 0-1 mixed-integer programs
por: Menal Guzelsoy, et al.
Publicado: (2013)