The following pages link to Federico Perea (Q336508):
Displaying 22 items.
- Finding the nucleolus of any \(n\)-person cooperative game by a single linear program (Q336509) (← links)
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- (Q1042047) (redirect page) (← links)
- Modeling cooperation on a class of distribution problems (Q1042048) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- Avoiding unfairness of \textit{Owen} allocations in linear production processes (Q1926711) (← links)
- Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks (Q2253567) (← links)
- A cooperative location game based on the 1-center location problem (Q2275823) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- GRASP algorithms for the robust railway network design problem (Q2359149) (← links)
- Dynamic programming analysis of the TV game ``Who wants to be a millionaire?'' (Q2371371) (← links)
- On minimax and Pareto optimal security payoffs in multicriteria games (Q2408652) (← links)
- 01. A new concept of robustness (Q2917366) (← links)
- (Q3019987) (← links)
- Integrating Robust Railway Network Design and Line Planning under Failures (Q3649169) (← links)
- Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints (Q5240130) (← links)
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
- The berth allocation and quay crane assignment problem with crane travel and setup times (Q6551060) (← links)
