Exact approaches for designing multifacility buy-at-bulk networks

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Institute for Operations Research and the Management Sciences INFORMS journal on computing
1. Verfasser: Arulselvan, Ashwin (VerfasserIn)
Weitere Verfasser: Rezapour, Mohsen (VerfasserIn), Welz, Wolfgang A. (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2017
Schlagworte:
facility location > buy-at-bulk > branch-price-and-cut algorithm > optical access networks > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
The risk-averse static stochastic knapsack problem 2021 Merzifonluoglu, Yasemin
Addressing orientation symmetry in the time window assignment vehicle routing problem 2021 Dalmeijer, Kevin
A mixed-integer fractional optimization approach to best subset selection 2021 Gómez, Andrés
Conflict-driven heuristics for mixed integer programming 2021 Witzig, Jakob
Scenario grouping and decomposition algorithms for chance-constrained programs 2021 Deng, Yan
Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem 2021 Estes, Alexander S.
Decomposing loosely coupled mixed-integer programs for optimal microgrid design 2021 Zolan, Alexander J.
Characterizing social TV activity around televised events : a joint topic model approach 2021 Hu, Yuheng
Improved computational approaches and heuristics for zero forcing 2021 Brimkov, Boris
Exact facetial odd-cycle separation for maximum cut and binary quadratic optimization 2021 Jünger, Michael
A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks 2021 Zhu, Xiaojun
Robust capacity planning for project management 2021 Conejo, Antonio J.
Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling 2021 Guo, Cheng
Modeling defender-attacker problems as robust linear programs with mixed-integer uncertainty sets 2021 Borrero, Juan S.
Structured robust submodular maximization : offline and online algorithms 2021 Torrico, Alfredo
SDDP.jl : a Julia package for stochastic dual dynamic programming 2021 Dowson, Oscar
Enumeration of the nondominated set of multiobjective discrete optimization problems 2021 Tamby, Satya
Optimization for L1-norm error fitting via data aggregation 2021 Park, Young Woong
Complexity results and effective algorithms for worst-case linear optimization under uncertainties 2021 Luo, Hezhi
A computational approach to first passage problems of reflected hyperexponential jump diffusion processes 2021 Cai, Ning
Alle Artikel auflisten