Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings / / edited by Pascal Van Hentenryck, Laurence Wolsey
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings / / edited by Pascal Van Hentenryck, Laurence Wolsey |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (399 p.) |
| Disciplina | 658.53 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Numerical analysis Computer science—Mathematics Discrete mathematics Algorithms Operations research Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science Operations Research and Decision Theory Discrete Mathematics |
| ISBN |
1-280-94921-X
9786610949212 3-540-72397-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The “Not-Too-Heavy Spanning Tree” Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. |
| Record Nr. | UNISA-996465998703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings / / edited by Pascal Van Hentenryck, Laurence Wolsey
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings / / edited by Pascal Van Hentenryck, Laurence Wolsey |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (399 p.) |
| Disciplina | 658.53 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Numerical analysis Computer science—Mathematics Discrete mathematics Algorithms Operations research Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science Operations Research and Decision Theory Discrete Mathematics |
| ISBN |
1-280-94921-X
9786610949212 3-540-72397-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The “Not-Too-Heavy Spanning Tree” Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. |
| Record Nr. | UNINA-9910767515903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Practical aspects of declarative languages : 8th international symposium, PADL 2006, Charleston, SC, USA, January 9-10, 2006 : proceedings / / Pascal Van Hentenryck (ed.)
| Practical aspects of declarative languages : 8th international symposium, PADL 2006, Charleston, SC, USA, January 9-10, 2006 : proceedings / / Pascal Van Hentenryck (ed.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (X, 234 p.) |
| Disciplina | 005.13 |
| Altri autori (Persone) | Van HentenryckPascal |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 2, Programming and software engineering |
| Soggetto topico | Programming languages (Electronic computers) - Semantics |
| ISBN | 3-540-31685-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Using CHRs to Generate Functional Test Cases for the Java Card Virtual Machine -- Generic Cut Actions for External Prolog Predicates -- Controlling Search Space Materialization in a Practical Declarative Debugger -- Automatic Verification of a Model Checker by Reflection -- Probabilistic-Logical Modeling of Music -- Using Dominators for Solving Constrained Path Problems -- JQuery: A Generic Code Browser with a Declarative Configuration Language -- A Hybrid BDD and SAT Finite Domain Constraint Solver -- Adding Constraint Solving to Mercury -- Modeling Genome Evolution with a DSEL for Probabilistic Programming -- Tabling in Mercury: Design and Implementation -- Translating Description Logic Queries to Prolog -- Efficient Top-Down Set-Sharing Analysis Using Cliques -- Querying Complex Graphs -- Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs. |
| Altri titoli varianti | PADL 2006 |
| Record Nr. | UNINA-9910483853103321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles and practice of constraint programming--CP 2002 : 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002 : proceedings / / Pascal Van Hentenryck (editor)
| Principles and practice of constraint programming--CP 2002 : 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002 : proceedings / / Pascal Van Hentenryck (editor) |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2002] |
| Descrizione fisica | 1 online resource (XVI, 794 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Constraint programming (Computer science) |
| ISBN | 3-540-46135-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Technical Papers -- Reduced Cost-Based Ranking for Generating Promising Subproblems -- Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem -- On Optimal Correction of Inconsistent Linear Constraints -- Temporal Planning through Mixed Integer Programming: A Preliminary Report -- A New Multi-resource cumulatives Constraint with Negative Heights -- On the Sum Constraint: Relaxation and Applications -- Global Constraints for Lexicographic Orderings -- A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations -- Amplification of Search Performance through Randomization of Heuristics -- Computing the Envelope for Stepwise-Constant Resource Allocations -- Local Probing Applied to Scheduling -- A Hybrid Approach for SAT -- Recovering and Exploiting Structural Knowledge from CNF Formulas -- Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation -- Accelerating Random Walks -- Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT -- Learning and Solving Soft Temporal Constraints: An Experimental Study -- Opportunistic Specialization in Russian Doll Search -- Range-Based Algorithm for Max-CSP -- Resolution Complexity of Random Constraints -- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics -- Determining the Number of Solutions to Binary CSP Instances -- Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions -- Open Constraint Satisfaction -- Beyond NP: Arc-Consistency for Quantified Constraints -- Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information -- A Dual Graph Translation of a Problem in ‘Life’ -- Groups and Constraints: Symmetry Breaking during Search -- Partial Symmetry Breaking -- Symmetry Breaking Revisited -- Breaking Row and Column Symmetries in Matrix Models -- Solving the Kirkman’s Schoolgirl Problem in a Few Seconds -- Inferring Constraint Types in Constraint Programming -- Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State -- The Adaptive Constraint Engine -- Indexical-Based Solver Learning -- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions -- Restart Policies with Dependence among Runs: A Dynamic Programming Approach -- Innovative Application -- Visopt ShopFloor: On the Edge of Planning and Scheduling -- Constraint Programming Contribution to Benders Decomposition: A Case Study -- Modeling Camera Control with Constrained Hypertubes -- Robust and Parallel Solving of a Network Design Problem -- Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints -- Communication and Computation in Distributed CSP Algorithms -- Posters -- Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints -- A Relaxation of the Cumulative Constraint -- Improving GSAT Using 2SAT -- A Relational Constraint Solver for Model-Based Engineering -- Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems -- Scaling Properties of Pure Random Walk on Random 3-SAT -- Criticality and Parallelism in Structured SAT Instances -- Characterizing SAT Problems with the Row Convexity Property -- Interchangeability in Soft CSPs -- On Constraint Problems with Incomplete or Erroneous Data -- Heuristic Constraint Propagation -- An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint -- Algebraic Properties of CSP Model Operators -- AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity -- Doctoral Program -- Integrating Search Objects in Asynchronous Constraint Solving -- Distributed Constraint-Based Railway Simulation -- Symmetry Breaking in Peaceably Coexisting Armies of Queens -- Batch Processing with Sequence Dependent Setup Times -- Interactive Heuristic Search Algorithm -- On Constraint Problems with Incomplete or Erroneous Data -- Design of a New Metaheuristic for MAXSAT Problems -- Disjunctive and Continuous Constraint Satisfaction Problems -- Tuning Randomization in Backtrack Search SAT Algorithms -- Constraint Solving in Test-Data Generation -- Improving Cost Calculations for Global Constraints in Local Search -- A Modeling Framework for Constraints -- A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design -- A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles -- Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling -- Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems -- A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form -- Models of Injection Problems -- Partial Symmetry Breaking -- Automatic Generation of Implied Clauses for SAT -- Bridging the Gap between SAT and CSP -- Reducing Symmetry in Matrix Models -- Studying Interchangeability in Constraint Satisfaction Problems -- Constraint Modeling in the Context of Academic Task Assignment -- Design Tradeoffs for Autonomous Trading Agents. |
| Record Nr. | UNISA-996465525203316 |
| Berlin, Germany : , : Springer, , [2002] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles and practice of constraint programming--CP 2002 : 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002 : proceedings / / Pascal Van Hentenryck (editor)
| Principles and practice of constraint programming--CP 2002 : 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002 : proceedings / / Pascal Van Hentenryck (editor) |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2002] |
| Descrizione fisica | 1 online resource (XVI, 794 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Constraint programming (Computer science) |
| ISBN | 3-540-46135-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Technical Papers -- Reduced Cost-Based Ranking for Generating Promising Subproblems -- Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem -- On Optimal Correction of Inconsistent Linear Constraints -- Temporal Planning through Mixed Integer Programming: A Preliminary Report -- A New Multi-resource cumulatives Constraint with Negative Heights -- On the Sum Constraint: Relaxation and Applications -- Global Constraints for Lexicographic Orderings -- A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations -- Amplification of Search Performance through Randomization of Heuristics -- Computing the Envelope for Stepwise-Constant Resource Allocations -- Local Probing Applied to Scheduling -- A Hybrid Approach for SAT -- Recovering and Exploiting Structural Knowledge from CNF Formulas -- Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation -- Accelerating Random Walks -- Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT -- Learning and Solving Soft Temporal Constraints: An Experimental Study -- Opportunistic Specialization in Russian Doll Search -- Range-Based Algorithm for Max-CSP -- Resolution Complexity of Random Constraints -- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics -- Determining the Number of Solutions to Binary CSP Instances -- Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions -- Open Constraint Satisfaction -- Beyond NP: Arc-Consistency for Quantified Constraints -- Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information -- A Dual Graph Translation of a Problem in ‘Life’ -- Groups and Constraints: Symmetry Breaking during Search -- Partial Symmetry Breaking -- Symmetry Breaking Revisited -- Breaking Row and Column Symmetries in Matrix Models -- Solving the Kirkman’s Schoolgirl Problem in a Few Seconds -- Inferring Constraint Types in Constraint Programming -- Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State -- The Adaptive Constraint Engine -- Indexical-Based Solver Learning -- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions -- Restart Policies with Dependence among Runs: A Dynamic Programming Approach -- Innovative Application -- Visopt ShopFloor: On the Edge of Planning and Scheduling -- Constraint Programming Contribution to Benders Decomposition: A Case Study -- Modeling Camera Control with Constrained Hypertubes -- Robust and Parallel Solving of a Network Design Problem -- Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints -- Communication and Computation in Distributed CSP Algorithms -- Posters -- Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints -- A Relaxation of the Cumulative Constraint -- Improving GSAT Using 2SAT -- A Relational Constraint Solver for Model-Based Engineering -- Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems -- Scaling Properties of Pure Random Walk on Random 3-SAT -- Criticality and Parallelism in Structured SAT Instances -- Characterizing SAT Problems with the Row Convexity Property -- Interchangeability in Soft CSPs -- On Constraint Problems with Incomplete or Erroneous Data -- Heuristic Constraint Propagation -- An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint -- Algebraic Properties of CSP Model Operators -- AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity -- Doctoral Program -- Integrating Search Objects in Asynchronous Constraint Solving -- Distributed Constraint-Based Railway Simulation -- Symmetry Breaking in Peaceably Coexisting Armies of Queens -- Batch Processing with Sequence Dependent Setup Times -- Interactive Heuristic Search Algorithm -- On Constraint Problems with Incomplete or Erroneous Data -- Design of a New Metaheuristic for MAXSAT Problems -- Disjunctive and Continuous Constraint Satisfaction Problems -- Tuning Randomization in Backtrack Search SAT Algorithms -- Constraint Solving in Test-Data Generation -- Improving Cost Calculations for Global Constraints in Local Search -- A Modeling Framework for Constraints -- A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design -- A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles -- Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling -- Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems -- A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form -- Models of Injection Problems -- Partial Symmetry Breaking -- Automatic Generation of Implied Clauses for SAT -- Bridging the Gap between SAT and CSP -- Reducing Symmetry in Matrix Models -- Studying Interchangeability in Constraint Satisfaction Problems -- Constraint Modeling in the Context of Academic Task Assignment -- Design Tradeoffs for Autonomous Trading Agents. |
| Record Nr. | UNINA-9910143892403321 |
| Berlin, Germany : , : Springer, , [2002] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||