Special issue on: Computational discrete optimization

Código QR

Special issue on: Computational discrete optimization

Guardado en:

Detalles Bibliográficos
Autores principales:	ArieM.C.A. Koster, Clemens Thielen
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2020
Materias:	90-08 90C10 90C27 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/260697c416094925823b0b3caa9be0aa
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
por: Christian Artigues, et al.
Publicado: (2018)

Formulations and algorithms for the recoverable Γ-robust knapsack problem
por: Christina Büsing, et al.
Publicado: (2019)

Speeding up column generation for robust wireless network planning
por: Grit Claßen, et al.
Publicado: (2013)

Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016)

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
por: François Clautiaux, et al.
Publicado: (2019)

The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020)

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017)

A MIP framework for non-convex uniform price day-ahead electricity auctions
por: Mehdi Madani, et al.
Publicado: (2017)

Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
por: FalkM. Hante, et al.
Publicado: (2019)

Bilevel programming for price-based electricity auctions: a revenue-constrained case
por: Ricardo Fernández-Blanco, et al.
Publicado: (2015)

Improved integral simplex using decomposition for the set partitioning problem
por: Abdelouahab Zaghrouti, et al.
Publicado: (2018)

Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013)

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

New exact solution approaches for the split delivery vehicle routing problem
por: Gizem Ozbaygin, et al.
Publicado: (2018)

A polyhedral approach to the generalized minimum labeling spanning tree problem
por: ThiagoGouveiada Silva, et al.
Publicado: (2019)

An exact approach for the multi-constraint graph partitioning problem
por: Diego Recalde, et al.
Publicado: (2020)

An improved cut-and-solve algorithm for the single-source capacitated facility location problem
por: SuneLauth Gadegaard, et al.
Publicado: (2018)

Solution methodologies for debris removal in disaster response
por: Nihal Berktaş, et al.
Publicado: (2016)

An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020)

Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019)

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
por: Luis Gouveia, et al.
Publicado: (2015)

A modification of the αBB method for box-constrained optimization and an application to inverse kinematics
por: Gabriele Eichfelder, et al.
Publicado: (2016)

Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
por: Jens Poppenborg, et al.
Publicado: (2016)

Sink location to find optimal shelters in evacuation planning
por: P. Heßler, et al.
Publicado: (2016)

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

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

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

Sufficient pruning conditions for MINLP in gas network design
por: Jesco Humpola, et al.
Publicado: (2017)

Improving strong branching by domain propagation
por: Gerald Gamrath
Publicado: (2014)

Matheuristics for optimizing the network in German wagonload traffic
por: Julia Sender, et al.
Publicado: (2017)

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

Evaluating performance of image segmentation criteria and techniques
por: DoritS. Hochbaum, et al.
Publicado: (2013)

Joint location and pricing within a user-optimized environment
por: Teodora Dan, et al.
Publicado: (2020)

A bounded degree SOS hierarchy for polynomial optimization
por: JeanB. Lasserre, et al.
Publicado: (2017)

Alternative SDP and SOCP approximations for polynomial optimization
por: Xiaolong Kuang, et al.
Publicado: (2019)

Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
por: Ulf Lorenz, et al.
Publicado: (2015)

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

A robust basic cyclic scheduling problem
por: Idir Hamaz, et al.
Publicado: (2018)

On global optimization with indefinite quadratics
por: Marcia Fampa, et al.
Publicado: (2017)

A unified matheuristic for solving multi-constrained traveling salesman problems with profits
por: Rahma Lahyani, et al.
Publicado: (2017)