X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (21) 21
computational complexity (14) 14
operations research & management science (12) 12
optimization (10) 10
studies (10) 10
analysis (9) 9
approximation algorithms (7) 7
mathematics (7) 7
minimum cost flow (7) 7
approximation (6) 6
calculus of variations and optimal control; optimization (6) 6
complexity (6) 6
mathematics, applied (6) 6
scheduling (6) 6
competitive analysis (5) 5
computer science, information systems (5) 5
lower bounds (5) 5
operations research (5) 5
operations research/decision theory (5) 5
after-treatment of the shaped products, e.g. repairing (4) 4
approximation scheme (4) 4
approximations (4) 4
computer science (4) 4
fixed start (4) 4
game theory (4) 4
jobs (4) 4
management science (4) 4
mathematical analysis (4) 4
online optimization (4) 4
performing operations (4) 4
polynomials (4) 4
shaping of material in a plastic state, not otherwise providedfor (4) 4
shaping or joining of plastics (4) 4
transporting (4) 4
working of plastics (4) 4
working of substances in a plastic state, in general (4) 4
algorithmic mechanism design (3) 3
berechnungskomplexität (3) 3
business and management (3) 3
combinatorial optimization (3) 3
computation (3) 3
computer science - data structures and algorithms (3) 3
computer science, interdisciplinary applications (3) 3
computer science, theory & methods (3) 3
end times (3) 3
games (3) 3
intervals (3) 3
mathematical models (3) 3
maximum flow problem (3) 3
networks (3) 3
online (3) 3
operation research/decision theory (3) 3
theory of computation (3) 3
timetabling (3) 3
traveling tournament problem (3) 3
algorithm (2) 2
artificial intelligence (2) 2
assignment problem (2) 2
benchmarking (2) 2
business and management, general (2) 2
business/management science, general (2) 2
combinatorics (2) 2
computer science - computational complexity (2) 2
computer science, hardware & architecture (2) 2
convex and discrete geometry (2) 2
demand (2) 2
engineering, manufacturing (2) 2
graphs (2) 2
images (2) 2
index medicus (2) 2
integer programming (2) 2
machines (2) 2
mathematical modeling and industrial mathematics (2) 2
mathematical optimization (2) 2
mathematics - optimization and control (2) 2
nash flows (2) 2
on-line systems (2) 2
optimization algorithms (2) 2
price of stability (2) 2
problem solving (2) 2
production scheduling (2) 2
randomized rounding (2) 2
selfish routing (2) 2
social choice (2) 2
supply chain management (2) 2
abvd (1) 1
aged 60 years (1) 1
aged patients (1) 1
algorithm analysis and problem complexity (1) 1
algorithmic game theory (1) 1
algorithmus (1) 1
allocations (1) 1
animal distribution (1) 1
animals (1) 1
anodonta-piscinalis bivalvia (1) 1
anthracyclines (1) 1
approximate pareto curve (1) 1
approximation algorithm (1) 1
assignment problems (1) 1
augmented revelation mechanism (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Operations Research for Health Care, ISSN 2211-6923, 12/2018, Volume 19, pp. 80 - 91
This paper presents a case study of duty rostering for physicians at a department of orthopedics and trauma surgery. We provide a detailed description of the... 
Integer programming | Physicians | Rostering | Personnel scheduling | Practice | Research | Psychic trauma | Orthopedics
Journal Article
Biological Reviews, ISSN 1464-7931, 02/2017, Volume 92, Issue 1, pp. 572 - 607
Journal Article
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2013, Volume 228, Issue 1, p. 46
  We consider a variant of the generalized assignment problem (GAP) where the amount of space used in each bin is restricted to be either zero (if the bin is... 
Studies | Algorithms | Assignment problem | Approximations | Polynomials
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 06/2018, Volume 100, pp. 301 - 3013
Conference Proceeding
International Journal of Game Theory, ISSN 0020-7276, 2018, Volume 48, Issue 1, pp. 337 - 361
We consider the classical mechanism design problem of fully implementing social choice functions in dominant strategies in settings where monetary payments are... 
Full implementation | Dominant strategies | Augmented revelation mechanism | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | INFORMATION | STATISTICS & PROBABILITY | SOCIAL SCIENCES, MATHEMATICAL METHODS | ECONOMICS | Economic models | Compatibility | Social sciences | Game theory
Journal Article
Mathematical Methods of Operations Research, ISSN 1432-2994, 4/2016, Volume 83, Issue 2, pp. 207 - 242
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2017, Volume 260, Issue 2, pp. 468 - 481
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in different stages and the goal is to... 
Online optimization | Competitive analysis | Scheduling | MACHINES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | END TIMES | APPROXIMATION | JOBS | INTERVALS | FIXED START | INDEPENDENT SETS | Scheduling (Management) | Problem solving | Algorithms | Analysis | Mathematical optimization
Journal Article
Information Processing Letters, ISSN 0020-0190, 06/2015, Volume 115, Issue 6-8, p. 570
  The authors consider a variant of the separable assignment problem (SAP). In the classic version of SAP, they are given a set of bins and a set of items to... 
Studies | Assignment problem | Packing problem | Information processing | Approximations | Optimization algorithms
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 06/2017, Volume 259, Issue 3, pp. 864 - 872
We present a specialized network simplex algorithm for the , which is an extension of the traditional minimum cost flow problem by a second kind of costs... 
Minimum cost flow | Algorithms | Network flow | Combinatorial optimization | Network simplex | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | CAPACITY SCALING ALGORITHM | Problem solving | Polynomials | Analysis | Usage | Budget rescission | Cost behavior
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2013, Volume 228, Issue 1, pp. 46 - 55
► We introduce a variant of the GAP including minimum quantities. ► We provide complexity and approximation results on different variants of the problem. ►... 
Approximation algorithms | Combinatorial optimization | Computational complexity | Assignment problems | TIME APPROXIMATION SCHEME | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Algorithms | Analysis
Journal Article
Networks, ISSN 0028-3045, 09/2016, Volume 68, Issue 2, pp. 141 - 158
We consider network design games with weighted players and uniform edge capacities and study their Nash equilibria. In these games, each player has to choose a... 
Nash equilibrium | network design games | price of stability | series‐parallel graphs | game theory | computational complexity | series-parallel graphs | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | BIN-PACKING | Game theory | Networks | Charging | Games | Feasibility | Mathematical models | Optimization | Players
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 4, pp. 345 - 351
We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to... 
Scheduling | Timetabling | Computational complexity | Traveling tournament problem | COMPUTER SCIENCE, THEORY & METHODS | Upper bounds | Computation | C (programming language) | Proving | Games | Benchmarking | Proposals | Complexity
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 09/2017, Volume 695, pp. 1 - 15
We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given and... 
Multicriteria optimization | Bicriteria approximation algorithm | Approximate Pareto curve | DESIGN | RESTRICTED SHORTEST-PATH | ALGORITHM | OPTIMIZATION | COMPUTER SCIENCE, THEORY & METHODS | IMPROVED FPTAS | Methods | Algorithms
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 5/2017, Volume 33, Issue 4, pp. 1226 - 1256
Journal Article
Networks, ISSN 0028-3045, 09/2013, Volume 62, Issue 2, pp. 125 - 131
We consider the maximum flow problem with minimum quantities (MFPMQ), which is a variant of the maximum flow problem where the flow on each arc in the network... 
maximum flow problem | minimum quantities | approximation algorithms | computational complexity | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Algorithms | Studies | Dynamic programming | Lower bounds | Networks | Approximation | Constrictions | Graphs | Polynomials | Complexity
Journal Article
Information Processing Letters, ISSN 0020-0190, 07/2012, Volume 112, Issue 13, pp. 523 - 524
Journal Article
Information Processing Letters, ISSN 0020-0190, 07/2012, Volume 112, Issue 13, pp. 523 - 524
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.