The following pages link to Emanuel Melachrinoudis (Q191788):
Displayed 30 items.
- Maximizing revenue of end of life items in retail stores (Q323500) (← links)
- Network location of a reliable center using the most reliable route policy (Q960392) (← links)
- Locating an undesirable facility with a minimax criterion (Q1066793) (← links)
- An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521) (← links)
- Complementarity and equivalence in finite source queueing models with spares (Q1317074) (← links)
- An analytical solution to the minimum \(L_ p\)-norm of a hyperplane (Q1363554) (← links)
- A maximum \(L_p\) distance problem (Q1378646) (← links)
- Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
- The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach (Q1577135) (← links)
- Optimizing the design of a CDMA cellular system configuration with multiple criteria (Q1599319) (← links)
- A path-based capacitated network flow model for empty railcar distribution (Q1695776) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions (Q2178373) (← links)
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives (Q2253362) (← links)
- Redesigning a warehouse network (Q2432895) (← links)
- A dial-a-ride problem for client transportation in a health-care organization (Q2433383) (← links)
- The linear multiple choice knapsack problem with equity constraints (Q2505312) (← links)
- An \(O(m^2+mn^2)\) algorithm for the bi-objective location problem on a network with mixed metrics (Q2627609) (← links)
- A heuristic approach to the single facility maximin location problem (Q3696815) (← links)
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem (Q3804415) (← links)
- A multiobjective model for the dynamic location of landfills (Q4229648) (← links)
- Facility Location and Reliable Route Planning in Hazardous Material Transportation (Q4363347) (← links)
- (Q4494443) (← links)
- Fourier-Motzkin elimination method in MOLP problems (Q4707187) (← links)
- A single facility location problem on a tree with unreliable edges (Q4887754) (← links)
- The Location of Undesirable Facilities (Q5506725) (← links)
- Dynamic Location and Entry Mode Selection of Multinational Manufacturing Facilities under Uncertainty: A Chance‐constrained Goal Programming Approach (Q5690289) (← links)
- The maximin-maxisum network location problem (Q5938475) (← links)
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications (Q5958050) (← links)