Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Approve / Request updates on publications
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
The minimum shift design problem: theory and practice
Luca Di Gaspero
, Johannes Gärtner
, Guy Kortsarz
, Nysret Musliu
, Andrea Schaerf
, Wolfgang Slany
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The minimum shift design problem: theory and practice'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shift Design
100%
Flow Problems
60%
Flow Cost
60%
Shift Work Schedule
40%
Hardness of Approximation
20%
Software Project
20%
Local Search Algorithm
20%
Maximum Flow
20%
Network Flow
20%
Greedy Heuristic
20%
Optimal Assignment
20%
Commercial Implementations
20%
Approximation Lower Bounds
20%
Minimum Cardinality
20%
Neighborhood Definition
20%
Scheduling Software
20%
Computer Science
Design Problem
100%
Shift Scheduling
40%
Software Project
20%
Approximation (Algorithm)
20%
Greedy Heuristic
20%
Cardinality
20%
Search Procedure
20%
Optimal Assignment
20%
Mathematics
Edge
100%
Cardinality
33%
time interval τ
33%
Local Search
33%
Optimal Assignment
33%