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
44
views
8
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,367
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Principles and Practice of Constraint Programming - CP 2002
A New Multi-resource cumulatives Constraint with Negative Heights
other
Author(s):
Nicolas Beldiceanu
,
Mats Carlsson
Publication date
(Online):
September 2 2002
Publisher:
Springer Berlin Heidelberg
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
Resource Identification
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
Extending chip in order to solve complex scheduling and placement problems
Nicolas Beldiceanu
,
Abderrahmane Aggoun
(1993)
0
comments
Cited
32
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Computational Geometry
Mark de Berg
,
Marc van Kreveld
,
Mark H Overmars
…
(1997)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Constraint-Based Scheduling
Philippe Baptiste
,
Claude le Pape
,
Wim Nuijten
(2001)
0
comments
Cited
24
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
September 2 2002
Pages
: 63-79
DOI:
10.1007/3-540-46135-3_5
SO-VID:
2c9b606c-eee1-464a-b598-f4ddcbe63741
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Reduced Cost-Based Ranking for Generating Promising Subproblems
pp. 17
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem
pp. 33
On Optimal Correction of Inconsistent Linear Constraints
pp. 47
Temporal Planning through Mixed Integer Programming: A Preliminary Report
pp. 63
A New Multi-resource cumulatives Constraint with Negative Heights
pp. 80
On the Sum Constraint: Relaxation and Applications
pp. 109
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
pp. 124
Amplification of Search Performance through Randomization of Heuristics
pp. 139
Computing the Envelope for Stepwise-Constant Resource Allocations
pp. 155
Local Probing Applied to Scheduling
pp. 172
A Hybrid Approach for SAT
pp. 185
Recovering and Exploiting Structural Knowledge from CNF Formulas
pp. 200
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
pp. 216
Accelerating Random Walks
pp. 233
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
pp. 249
Learning and Solving Soft Temporal Constraints: An Experimental Study
pp. 264
Opportunistic Specialization in Russian Doll Search
pp. 280
Range-Based Algorithm for Max-CSP
pp. 295
Resolution Complexity of Random Constraints
pp. 327
Determining the Number of Solutions to Binary CSP Instances
pp. 341
Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions
pp. 356
Open Constraint Satisfaction
pp. 371
Beyond NP: Arc-Consistency for Quantified Constraints
pp. 387
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
pp. 402
A Dual Graph Translation of a Problem in ‘Life’
pp. 415
Groups and Constraints: Symmetry Breaking during Search
pp. 431
Partial Symmetry Breaking
pp. 446
Symmetry Breaking Revisited
pp. 462
Breaking Row and Column Symmetries in Matrix Models
pp. 477
Solving the Kirkman’s Schoolgirl Problem in a Few Seconds
pp. 492
Inferring Constraint Types in Constraint Programming
pp. 508
Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State
pp. 525
The Adaptive Constraint Engine
pp. 541
Indexical-Based Solver Learning
pp. 556
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
pp. 573
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
pp. 587
Visopt ShopFloor: On the Edge of Planning and Scheduling
pp. 603
Constraint Programming Contribution to Benders Decomposition: A Case Study
pp. 618
Modeling Camera Control with Constrained Hypertubes
pp. 633
Robust and Parallel Solving of a Network Design Problem
pp. 649
Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints
pp. 664
Communication and Computation in Distributed CSP Algorithms
pp. 680
Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints
pp. 686
A Relaxation of the Cumulative Constraint
pp. 691
Improving GSAT Using 2SAT
pp. 696
A Relational Constraint Solver for Model-Based Engineering
pp. 702
Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems
pp. 708
Scaling Properties of Pure Random Walk on Random 3-SAT
pp. 714
Criticality and Parallelism in Structured SAT Instances
pp. 720
Characterizing SAT Problems with the Row Convexity Property
pp. 726
Interchangeability in Soft CSPs
pp. 732
On Constraint Problems with Incomplete or Erroneous Data
pp. 738
Heuristic Constraint Propagation
pp. 744
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint
pp. 750
Algebraic Properties of CSP Model Operators
pp. 755
AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity
pp. 761
Integrating Search Objects in Asynchronous Constraint Solving
pp. 762
Distributed Constraint-Based Railway Simulation
pp. 763
Symmetry Breaking in Peaceably Coexisting Armies of Queens
pp. 764
Batch Processing with Sequence Dependent Setup Times
pp. 765
Interactive Heuristic Search Algorithm
pp. 766
On Constraint Problems with Incomplete or Erroneous Data
pp. 767
Design of a New Metaheuristic for MAXSAT Problems
pp. 768
Disjunctive and Continuous Constraint Satisfaction Problems
pp. 769
Tuning Randomization in Backtrack Search SAT Algorithms
pp. 770
Constraint Solving in Test-Data Generation
pp. 772
Improving Cost Calculations for Global Constraints in Local Search
pp. 773
A Modeling Framework for Constraints
pp. 775
A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design
pp. 777
A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles
pp. 778
Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling
pp. 779
Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems
pp. 780
A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form
pp. 781
Models of Injection Problems
pp. 782
Partial Symmetry Breaking
pp. 783
Automatic Generation of Implied Clauses for SAT
pp. 784
Bridging the Gap between SAT and CSP
pp. 786
Reducing Symmetry in Matrix Models
pp. 787
Studying Interchangeability in Constraint Satisfaction Problems
pp. 789
Constraint Modeling in the Context of Academic Task Assignment
pp. 790
Design Tradeoffs for Autonomous Trading Agents
Similar content
1,367
Nutrient intake in the bovine during early and mid-gestation causes sex-specific changes in progeny plasma IGF-I, liveweight, height and carcass traits.
Authors:
G C Micke
,
T M Sullivan
,
K L Gatford
…
Secular trends in average height and age at menarche of ethnic Russians and Komi-Permyaks of the Permsky Krai, Russia.
Authors:
Andrew I Kozlov
,
Galina Vershubsky
Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control
Authors:
,
,
…
See all similar
Cited by
8
A \(O(n \log ^2 n)\) Checker and \(O(n^2 \log n)\) Filtering Algorithm for the Energetic Reasoning
Authors:
Yanick Ouellet
,
Claude-Guy Quimper
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems
Authors:
Frederic Boussemart
,
Christophe Lecoutre
,
Cédric Piette
Global Constraints and Filtering Algorithms
Authors:
Jean-Charles Régin
See all cited by