Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
25
views
29
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
930
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Science – Theory and Applications
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
other
Author(s):
René van Bevern
,
Artem V. Pyatkin
Publication date
(Online):
May 31 2016
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
International Polymer Processing
Most cited references
29
Record
: found
Abstract
: not found
Article
: not found
Integer Programming with a Fixed Number of Variables
H. W. Lenstra
(1983)
0
comments
Cited
181
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Invitation to Fixed-Parameter Algorithms
Rolf Niedermeier
(2006)
0
comments
Cited
95
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Minkowski's Convex Body Theorem and Integer Programming
Ravi Kannan
(1987)
0
comments
Cited
93
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
May 31 2016
Pages
: 73-87
DOI:
10.1007/978-3-319-34171-2_6
SO-VID:
2ddd6b77-9d7e-43e8-ae55-9ee72c27ea82
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On High-Quality Synthesis
pp. 16
Sensitivity Versus Certificate Complexity of Boolean Functions
pp. 29
Algorithmic Decidability of Engel’s Property for Automaton Groups
pp. 41
The Next Whisky Bar
pp. 57
Parameterizing Edge Modification Problems Above Lower Bounds
pp. 73
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
pp. 88
Max-Closed Semilinear Constraint Satisfaction
pp. 102
Computing and Listing st-Paths in Public Transportation Networks
pp. 117
Compositional Design of Stochastic Timed Automata
pp. 131
Online Bounded Analysis
pp. 146
Affine Computation and Affine Automaton
pp. 161
On Approximating (Connected) 2-Edge Dominating Set by a Tree
pp. 177
Graph Editing to a Given Degree Sequence
pp. 192
Subclasses of Baxter Permutations Based on Pattern Avoidance
pp. 207
On Slepian–Wolf Theorem with Interaction
pp. 223
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
pp. 237
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
pp. 251
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
pp. 266
Sums of Read-Once Formulas: How Many Summands Suffice?
pp. 280
Algorithmic Statistics: Normal Objects and Universal Models
pp. 294
Subquadratic Algorithms for Succinct Stable Matching
pp. 309
Depth-4 Identity Testing and Noether’s Normalization Lemma
pp. 324
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
pp. 340
The Hardest Language for Conjunctive Grammars
pp. 352
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
pp. 367
Representations of Analytic Functions and Weihrauch Degrees
pp. 382
On Expressive Power of Regular Expressions over Infinite Orders
pp. 394
Prediction of Infinite Words with Automata
pp. 409
Fourier Sparsity of GF(2) Polynomials
Similar content
930
Somali Shops ‘Are Fronts’—Man Claims Terrorist Group Is Behind Some Tuck Shops
Authors:
Makhaye Chris
Effects of a grocery shopping intervention designed to improve diet adherence in diabetes: a randomized trial.
Authors:
Stephanie Anzman-Frasca
,
Lily McGovern
,
Mackenzie J Ferrante
…
ANALYSIS OF QUALITATIVE DATA USING GLIM TWO EXAMPLES BASED ON SHOPPING SURVEY DATA
Authors:
S. Bowlby
,
J. SILK
See all similar
Cited by
3
Scheduling meets n-fold integer programming
Authors:
Dušan Knop
,
Martin Koutecký
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Authors:
Danny Hermelin
,
Shlomo Karhi
,
Michael Pinedo
…
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
Authors:
Shlomo Karhi
,
Mike Pinedo
,
Dvir Shabtay
…
See all cited by