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 | ||
| ||