Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Linda van Norden"'
Publikováno v:
Zeitschrift fur Betriebswirtschaft, 76(2), 125-138. Springer International Publishing AG
For the tendering of long-term transportation contracts in the bulk industry, shippers use bidbooks that specify for each lane the load location, the destination, the product and the volume that has to be transported over the next so many years. Bidb
Publikováno v:
Journal of Scheduling, 9(6), 559-568. Springer New York
For the $$\mathcal{NP}$$ -hard problem of scheduling n jobs in a two-machine flow shop so as to minimize the total completion time, we present two equivalent lower bounds that are computable in polynomial time. We formulate the problem by the use of
Autor:
Linda van Norden, Steef van de Velde
Publikováno v:
European Journal of Operational Research, 165(1), 127-138. Elsevier
Although transportation costs can form more than 50% of the total logistics costs of a product, they are often neglected in lot-sizing research and modelling. Nonetheless, the body of research that does take transportation costs into account is gradu
Autor:
Linda van Norden, Hans van Maaren
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 44:157-177
An enhanced concept of sub-optimal reverse Horn fraction of a CNF-formula was introduced in [18]. It was shown that this fraction is very useful in effectively (almost) separating 3-colorable random graphs with fixed node-edge density from the non-3-
Autor:
Linda van Norden, Hans van Maaren
Publikováno v:
Theory and Applications of Satisfiability Testing ISBN: 9783540262763
SAT
SAT
Recently the Mathematical Programming community showed a renewed interest in Hilbert's Positivstellensatz. The reason for this is that global optimization of polynomials in ℝ[x1,...,xn] is $\mathcal{NP}$-hard, while the question whether a polynomia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77ac0798dd426acffeb1eb91eae6b0ea
https://doi.org/10.1007/11499107_22
https://doi.org/10.1007/11499107_22
Autor:
Hans van Maaren, Linda van Norden
Publikováno v:
Theory and Applications of Satisfiability Testing ISBN: 9783540208518
SAT
SAT
Experimental evidence is presented that hidden threshold phenomena exist for fixed density random 3-SAT and graph-3-coloring formulae. At such fixed densities the average Horn fraction (computed with a specially designed algorithm) appears to be a pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fc015a9764156c12a35257226032729
https://doi.org/10.1007/978-3-540-24605-3_11
https://doi.org/10.1007/978-3-540-24605-3_11
Autor:
Linda van Norden, Hans van Maaren
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540441205
CP
CP
We will present an algorithm for the satisfiability problem, which finds its origin in the Integer Programming area, and therefore will also generalize to more general constraint programming problems. This algorithm is based on single-lookahead unit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf4c889161befb6f427c6ba85dcd8193
https://doi.org/10.1007/3-540-46135-3_71
https://doi.org/10.1007/3-540-46135-3_71
Publikováno v:
Journal of Scheduling; Dec2006, Vol. 9 Issue 6, p559-568, 10p
Autor:
Hans van Maaren, Linda van Norden
Publikováno v:
Annals of Mathematics & Artificial Intelligence; May2005, Vol. 44 Issue 1/2, p157-177, 21p
Autor:
Linda Van Norden
Publikováno v:
Huntington Library Quarterly. 13:131-160
TVHAT self-styled "College of Antiquaries" which flourished in Elizabeth's reign, and of whose fellows William Camden was most representative, existed in order to clarify the English past. The "antiquaries" were historians-some of them great historia