scholarly journals A novel exact solution algorithm for a robust product portfolio problem under return uncertainty

2021 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Alireza Goli ◽  
Hassan Khademi Zare ◽  
Reza Tavakkoli-Moghaddam ◽  
Ahmad Sadeghieh
Keyword(s):  
Exact Solution ◽  
Solution Algorithm ◽  
Product Portfolio ◽  
Portfolio Problem

scholarly journals Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 187-209 ◽  
Author(s):  
Alireza Goli ◽  
◽  
Hasan Khademi Zare ◽  
Reza Tavakkoli-Moghaddam ◽  
Ahmad Sadeghieh ◽  
...  
Keyword(s):  
Robust Optimization ◽  
Optimization Algorithm ◽  
Product Portfolio ◽  
Invasive Weed Optimization ◽  
Invasive Weed ◽  
Portfolio Problem

Vehicle Sequencing at Transshipment Terminals with Handover Relations

2020 ◽  
Author(s):  
Dirk Briskorn ◽  
Malte Fliedner ◽  
Martin Tschöke
Keyword(s):  
Exact Solution ◽  
Computational Study ◽  
Solution Algorithm ◽  
Comprehensive Analysis ◽  
Container Terminals ◽  
Decision Problems ◽  
Operational Planning ◽  
Vast Number ◽  
Synchronization Problem ◽  
Structural Connections

Operational planning at transshipment nodes is a wide and challenging field of research that covers a vast number of distinct relevant applications, spanning from seaport container terminals to rail terminals to cross-docks. In this work, we study the feasibility version of a fundamental synchronization problem that assigns incoming vehicles to docking resources subject to handover relations. We carry out a comprehensive analysis of computational complexity of various problem variants and establish structural connections to famous decision problems in graph theory. We further propose an exact solution algorithm for finding feasible dock assignments, if vehicles can visit the node only once and evaluate its performance in a comprehensive computational study.

MULTI-SOURCE SPANNING TREE PROBLEMS

2000 ◽  
Vol 01 (01) ◽  
pp. 61-71 ◽  
Author(s):  
ARTHUR M. FARLEY ◽  
PARASKEVI FRAGOPOULOU ◽  
DAVID KRUMME ◽  
ANDRZEJ PROSKUROWSKI ◽  
DANA RICHARDS
Keyword(s):  
Exact Solution ◽  
Spanning Tree ◽  
Polynomial Solution ◽  
Solution Algorithm ◽  
Efficient Algorithms ◽  
Strong Sense ◽  
Alternative Measure ◽  
Multicast Communication ◽  
Multiple Sources ◽  
Sum Of Distances

We consider a model of multicast communication in a network whereby multiple sources have messages to disseminate among all sites of a network. We propose that the messages from all sources are disseminated along the same spanning tree of the network and consider the problem of constructing an optimal such tree. One measure for suitability of the construction is the sum of distances from all sources to all other vertices. We show that finding the exact solution in this case in [Formula: see text]-hard (in the strong sense). We then investigate solutions for some restricted classes of graphs and give efficient algorithms for those. We also consider an alternative measure of goodness for the spanning tree, being the maximum eccentricity of a source. We show that the problem of finding such a minimum eccentricity spanning tree is somewhat easier to solve and give a pseudo-polynomial solution algorithm.

Sign in / Sign up

Export Citation Format

Share Document