CPAIOR 2008 - PDF Preprint Papers

CPAIOR 2008 Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CPAIOR-2008 Paper

click to vote

CPAIOR
2008
Springer

198views Operations Research» more CPAIOR 2008»

Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization

13 years 6 months ago

Download cs.brown.edu

The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...

Luc Mercier, Pascal Van Hentenryck

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	198	Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization	claim
2	197	The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems	claim
3	140	A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem	claim
4	135	Counting Solutions of Knapsack Constraints	claim
5	134	Gap Reduction Techniques for Online Stochastic Project Scheduling	claim
6	133	Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic	claim
7	132	CP with ACO	claim
8	128	Fast and Scalable Domino Portrait Generation	claim
9	119	Constraint Integer Programming: A New Approach to Integrate CP and MIP	claim
10	117	Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints	claim
11	116	Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs	claim
12	114	Connections in Networks: A Hybrid Approach	claim
13	114	Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints	claim
14	113	The Steel Mill Slab Design Problem Revisited	claim
15	112	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting	claim
16	111	Efficient Haplotype Inference with Combined CP and OR Techniques	claim
17	109	Multi-stage Benders Decomposition for Optimizing Multicore Architectures	claim
18	109	Propagating Separable Equalities in an MDD Store	claim
19	107	Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver	claim
20	103	Optimal Deployment of Eventually-Serializable Data Services	claim
21	100	Filtering Atmost1 on Pairs of Set Variables	claim
22	91	The Polytope of Tree-Structured Binary Constraint Satisfaction Problems	claim
23	90	Counting Solutions of Integer Programs Using Unrestricted Subtree Detection	claim
24	85	From High-Level Model to Branch-and-Price Solution in G12	claim
25	80	A Novel Approach For Detecting Symmetries in CSP Models	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers