A branch-price-and-cut procedure for the discrete ordered median problem

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Institute for Operations Research and the Management Sciences INFORMS journal on computing
1. Verfasser: Deleplanque, Samuel (VerfasserIn)
Weitere Verfasser: Labbé, Martine (VerfasserIn), Ponce, Diego (VerfasserIn), Puerto, Justo (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
discrete optimization > location theory > branch and price > ordered median problems > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Polyhedral results and branch-and-cut for the resource loading problem 2021 Song, Guopeng
Perspective reformulations of semicontinuous quadratically constrained quadratic programs 2021 Zheng, Xiaojin
A review selection method for finding an informative subset from online reviews 2021 Zhang, Jin
Worst-case expected shortfall with univariate and bivariate marginals 2021 Dhara, Anulekha
Piecewise constant decision rules via branch-and-bound based scenario detection for integer adjustable robust optimization 2021 Romeijnders, Ward
Modeling single-picker routing problems in classical and modern warehouses 2021 Goeke, Dominik
A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants 2021 Luo, Zhixing
Supervised t-distributed stochastic neighbor embedding for data visualization and classification 2021 Cheng, Yichen
Data-driven preference learning methods for value-driven multiple criteria sorting with interacting criteria 2021 Liu, Jiapeng
Reducing simulation input-model risk via input model averaging 2021 Nelson, Barry L.
Lagrangian duality for robust problems with decomposable functions : the case of a robust inventory problem 2021 Rodrigues, Filipe
Learning to solve large-scale security-constrained unit commitment problems 2021 Xavier, Álinson S.
Combinatorial benders decomposition for the two-dimensional bin packing problem 2021 Côté, Jean-François
The rank-one quadratic assignment problem 2021 Wang, Yang
A framework for solving chance-constrained linear matrix inequality programs 2021 Karimi, Roya
Extreme ray feasibility cuts for unit commitment with uncertainty 2021 Li, Chao
Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded 2021 Mistry, Miten
Linearized robust counterparts of two-wtage robust optimization problems with applications in operations management 2021 Ardestani-Jaafari, Amir
An exact algorithm for large-scale continuous nonlinear resource allocation problems with minimax regret objectives 2021 Park, Jungho
Multiproduct newsvendor problem with customer-driven demand substitution : a stochastic integer program perspective 2021 Zhang, Jie
Alle Artikel auflisten