The following pages link to Gaia Nicosia (Q294720):
Displaying 37 items.
- On-line scheduling with setup costs (Q294721) (← links)
- The Subset Sum game (Q296979) (← links)
- Minimum cost paths over dynamic networks (Q325482) (← links)
- Strategies in competing subset selection (Q367644) (← links)
- Maximin fairness in project budget allocation (Q510932) (← links)
- Stable routing under the Spanning Tree Protocol (Q613335) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- Competitive subset selection with two agents (Q643027) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Scheduling three chains on two parallel machines (Q1040986) (← links)
- Optimally balancing assembly lines with different workstations (Q1348257) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- Price of fairness in two-agent single-machine scheduling problems (Q1728475) (← links)
- Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
- An exact algorithm for a multicommodity min-cost flow over time problem (Q1742211) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Price of fairness for allocating a bounded resource (Q1752883) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Two agent scheduling with a central selection mechanism (Q2355710) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- Part batching and scheduling in a flexible cell to minimize setup costs (Q2464379) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- (Q2753935) (← links)
- Two Agents Competing for a Shared Machine (Q2868541) (← links)
- Single-Machine Scheduling Problems with Generalized Preemption (Q2901041) (← links)
- Optimal power control in OFDMA cellular networks (Q3008916) (← links)
- On the bicriteria <i>k</i> -server problem (Q3188988) (← links)
- Subset Weight Maximization with Two Competing Agents (Q3645306) (← links)
- (Q4449245) (← links)
- Cheapest paths in dynamic networks (Q4565769) (← links)
- Exact algorithms for a discrete metric labeling problem (Q5899363) (← links)
- Exact algorithms for a discrete metric labeling problem (Q5920404) (← links)
