top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005 / / edited by Roman Barták, Michela Milano
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005 / / edited by Roman Barták, Michela Milano
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XII, 412 p.)
Disciplina 005.1/16
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Numerical analysis
Computer science—Mathematics
Discrete mathematics
Computer networks
Information technology—Management
Artificial Intelligence
Numerical Analysis
Discrete Mathematics in Computer Science
Computer Communication Networks
Computer Application in Administrative Data Processing
ISBN 9783540322641
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Integration of Rules and Optimization in Plant PowerOps -- Embedded Systems Design: Optimization Challenges -- Models for Solving the Travelling Salesman Problem -- Technical Papers -- Set Variables and Local Search -- The Temporal Knapsack Problem and Its Solution -- Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles -- The tree Constraint -- Filtering Algorithms for the NValue Constraint -- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming -- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems -- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price -- Constraint Programming Based Column Generation for Employee Timetabling -- Scheduling Social Golfers Locally -- Multiconsistency and Robustness with Global Constraints -- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations -- Shorter Path Constraints for the Resource Constrained Shortest Path Problem -- Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation -- Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price -- A Search-Infer-and-Relax Framework for Integrating Solution Methods -- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs -- Symmetry Breaking and Local Search Spaces -- Combination of Among and Cardinality Constraints -- On the Tractability of Smooth Constraint Satisfaction Problems -- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems -- Symmetry and Search in a Network Design Problem -- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems -- Formulations and Reformulations in Integer Programming -- Nondeterministic Control for Hybrid Search -- Computing Explanations for the Unary Resource Constraint.
Record Nr. UNISA-996465782203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005 / / edited by Roman Barták, Michela Milano
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005 / / edited by Roman Barták, Michela Milano
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XII, 412 p.)
Disciplina 005.1/16
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Numerical analysis
Computer science - Mathematics
Discrete mathematics
Computer networks
Information technology - Management
Artificial Intelligence
Numerical Analysis
Discrete Mathematics in Computer Science
Computer Communication Networks
Computer Application in Administrative Data Processing
ISBN 9783540322641
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Integration of Rules and Optimization in Plant PowerOps -- Embedded Systems Design: Optimization Challenges -- Models for Solving the Travelling Salesman Problem -- Technical Papers -- Set Variables and Local Search -- The Temporal Knapsack Problem and Its Solution -- Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles -- The tree Constraint -- Filtering Algorithms for the NValue Constraint -- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming -- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems -- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price -- Constraint Programming Based Column Generation for Employee Timetabling -- Scheduling Social Golfers Locally -- Multiconsistency and Robustness with Global Constraints -- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations -- Shorter Path Constraints for the Resource Constrained Shortest Path Problem -- Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation -- Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price -- A Search-Infer-and-Relax Framework for Integrating Solution Methods -- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs -- Symmetry Breaking and Local Search Spaces -- Combination of Among and Cardinality Constraints -- On the Tractability of Smooth Constraint Satisfaction Problems -- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems -- Symmetry and Search in a Network Design Problem -- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems -- Formulations and Reformulations in Integer Programming -- Nondeterministic Control for Hybrid Search -- Computing Explanations for the Unary Resource Constraint.
Record Nr. UNINA-9910483618003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui