The following pages link to Eyjólfur Ingi Ásgeirsson (Q284426):
Displaying 12 items.
- Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
- Bridging the gap between self schedules and feasible schedules in staff scheduling (Q475167) (← links)
- (Q1041338) (redirect page) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- Divide-and-Conquer Approximation Algorithm for Vertex Cover (Q3583300) (← links)
- (Q5111461) (← links)
- Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover (Q5233467) (← links)
- Vertex Cover Approximations on Random Graphs (Q5432321) (← links)
- Experimental and Efficient Algorithms (Q5710054) (← links)
- Integer Programming and Combinatorial Optimization (Q5712478) (← links)
- Brief announcement (Q5891968) (← links)
- Quantitative methods for decision support in the Icelandic fishing industry (Q6550422) (← links)
