X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (234) 234
mathematics, applied (154) 154
approximation (112) 112
computer science, theory & methods (111) 111
operations research & management science (109) 109
computer science (93) 93
polynomials (93) 93
mathematical analysis (87) 87
scheduling (83) 83
optimization (82) 82
approximation algorithms (81) 81
polynomial time approximation scheme (80) 80
mathematics (76) 76
polynomial-time approximation scheme (70) 70
complexity (60) 60
studies (57) 57
fully polynomial time approximation scheme (55) 55
dynamic programming (53) 53
approximation algorithm (51) 51
theory of computation (47) 47
analysis (42) 42
polynomial-time algorithm (42) 42
computer science, software engineering (39) 39
fully polynomial-time approximation scheme (39) 39
algorithm (34) 34
combinatorics (34) 34
operations research/decision theory (32) 32
graphs (31) 31
mathematical models (31) 31
theoretical computer science (29) 29
computer science, interdisciplinary applications (28) 28
polynomial-time (26) 26
linear programming (24) 24
computational complexity (23) 23
computer science, information systems (23) 23
mathematics of computing (23) 23
convex and discrete geometry (21) 21
np-hardness (21) 21
algorithm analysis and problem complexity (20) 20
computer science, hardware & architecture (20) 20
production scheduling (20) 20
traveling salesman problem (20) 20
applied mathematics (19) 19
makespan (19) 19
mathematical modeling and industrial mathematics (19) 19
research (19) 19
operations research (18) 18
single-machine (18) 18
polynomial time (17) 17
polynomial time approximation schemes (17) 17
management science (16) 16
approximations (15) 15
combinatorial optimization (15) 15
computation (15) 15
computer systems organization and communication networks (15) 15
data structures, cryptology and information theory (15) 15
fptas (15) 15
models (15) 15
parallel machines (15) 15
planar graphs (15) 15
release dates (15) 15
approximation theory (14) 14
computational theory and mathematics (14) 14
np-hard (14) 14
numerical analysis (14) 14
usage (14) 14
completion time (13) 13
knapsack problem (13) 13
networks (13) 13
operation research/decision theory (13) 13
computational mathematics and numerical analysis (12) 12
engineering, industrial (12) 12
hardness (12) 12
management (12) 12
schemes (12) 12
trees (12) 12
approximation scheme (11) 11
economics / management science (11) 11
integers (11) 11
machinery (11) 11
methods (11) 11
routing (11) 11
time (11) 11
discrete mathematics and combinatorics (10) 10
engineering, manufacturing (10) 10
euclidean geometry (10) 10
graph theory (10) 10
jobs (10) 10
polynomial-time approximation schemes (10) 10
artificial intelligence (9) 9
computer science, general (9) 9
heuristics (9) 9
magneto-electric machines (9) 9
mathematics, interdisciplinary applications (9) 9
np-completeness (9) 9
optimization algorithms (9) 9
polynomial time algorithms (9) 9
pseudo-polynomial time algorithm (9) 9
tree (9) 9
bin packing (8) 8
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


European Journal of Operational Research, ISSN 0377-2217, 02/2020, Volume 281, Issue 1, pp. 16 - 24
•Any instance can be reduced to a restricted-type instance.•A feasible strongly structured schedule is close to a feasible schedule.•A linear program can be... 
Scheduling | Parallel two-stage flow-shops | Makespan | Mixed integer program | Polynomial-time approximation scheme | MACHINES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | HYBRID FLOWSHOP | ALGORITHMS | HEURISTICS
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2005, Volume 35, Issue 3, pp. 713 - 728
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2018, Volume 725, pp. 64 - 78
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. Let D... 
Polynomial-time approximation scheme | Maximum coverage | Geometric set cover | PLACEMENT | SETS | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | RECTANGLES | Computer science | Algorithms
Journal Article
Naval Research Logistics (NRL), ISSN 0894-069X, 03/2016, Volume 63, Issue 2, pp. 172 - 183
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed... 
scheduling | late work | fully polynomial‐time approximation scheme | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Naval | Scheduling | Maintenance | Optimization | Logistics
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2018, Volume 734, pp. 24 - 31
In the parallel k-stage flow-shops problem, we are given m identical k-stage flow-shops and a set of jobs. Each job can be processed by any one of the... 
Multiprocessor scheduling | Makespan | Flow-shop scheduling | Polynomial-time approximation scheme | Linear program | 2-STAGE FLOWSHOP | STAGE | ALGORITHMS | HEURISTICS | SCHEDULING PROBLEM | MACHINES | COMPLEXITY | HYBRID FLOWSHOP | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Engineering Optimization, ISSN 0305-215X, 11/2019, Volume 51, Issue 11, pp. 1938 - 1943
This article considers a single machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The... 
deteriorating jobs | Scheduling | single machine | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Production scheduling | Polynomials | Dynamic programming
Journal Article
Networks, ISSN 0028-3045, 12/2003, Volume 42, Issue 4, pp. 202 - 208
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2013, Volume 468, pp. 114 - 121
Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the... 
Parallel machines | Fully polynomial time approximation scheme | Dynamic programming | Algorithm | Agent scheduling | SINGLE-MACHINE | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Journal of Global Optimization, ISSN 0925-5001, 8/2017, Volume 68, Issue 4, pp. 749 - 775
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2020, Volume 803, pp. 57 - 70
A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general... 
Proportionate | Fully polynomial-time approximation scheme | Scheduling | Mixed shop | Approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Proceedings of the Steklov Institute of Mathematics, ISSN 0081-5438, 12/2017, Volume 299, Issue S1, pp. 97 - 105
The Generalized Traveling Salesman Problem (GTSP) is defined by a weighted graph G = (V,E,w) and a partition of its vertex set into k disjoint clusters V = V 1... 
Mathematics, general | Mathematics | NP-hard problem | polynomial-time approximation scheme | generalized traveling salesman problem | MATHEMATICS | MATHEMATICS, APPLIED | ALGORITHMS
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2014, Volume 28, Issue 4, pp. 1725 - 1796
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 71 - 78
We address the problem of minimizing a half-product function, with and without a linear knapsack constraint. We show how to convert known fully polynomial-time... 
Quadratic knapsack | FPTAS | Half-product | Differential approximation schemes | MATHEMATICS, APPLIED | SINGLE-MACHINE | ALGORITHM | MINIMIZING SUBMODULAR FUNCTIONS | WEIGHTED COMPLETION-TIME | POLYNOMIAL-TIME | MINIMIZATION | NON-AVAILABILITY INTERVAL | QUADRATIC KNAPSACK-PROBLEM | OPTIMIZATION
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2012, Volume 41, Issue 3, pp. 684 - 713
We give a polynomial-time approximation scheme for the generalization of Huffman coding in which codeword letters have nonuniform costs (as in Morse code,... 
Polynomial-time approximation scheme | Huffman coding with letter costs | MATHEMATICS, APPLIED | UNEQUAL LETTER COSTS | polynomial-time approximation scheme | EQUIPROBABLE WORDS | CHANNEL | PREFIX-FREE CODES | ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | NOISELESS | Computer Science - Data Structures and Algorithms
Journal Article
No results were found for your search.

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