Kooperativer Bibliotheksverbund

UID:

Format: XVI, 495 S. : , graph. Darst.

ISBN: 0-471-38521-2

Series Statement: Wiley interscience series in discrete mathematics and optimization

Language: English

Subjects: Mathematics

Keywords: Lineare Optimierung ; Optimierung ; Mathematische Logik

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009065854&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

URL: Autorenbiografie

URL: Verlagsangaben

URL: Cover

URL: Inhaltstext

URL: http://www.loc.gov/catdir/toc/onix06/99088732.html

UID:

Format: 1 online resource (xvi, 495 pages) : , illustrations

Edition: Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011.

ISBN: 9781118033036 , 1118033035

Note: Front Matter -- Introduction -- Some Examples -- The Logic of Propositions -- The Logic of Discrete Variables -- The Logic of 0-1 Inequalities -- Cardinality Clauses -- Classical Boolean Methods -- Logic-Based Modeling -- Logic-Based Branch and Bound -- Constraint Generation -- Domain Reduction -- Constraint Programming -- Continuous Relaxations -- Decomposition Methods -- Branching Rules -- Relaxation Duality -- Inference Duality -- Search Strategies -- Logic-Based Benders Decomposition -- Nonserial Dynamic Programming -- Discrete Relaxations -- References -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Logic and Optimization , Optimization and Constraint Satisfaction , Constraint Programming , Development of Logic-Based Methods , Recent Applications and Software , Organization of the Book , How Much to Read , Background Material , A Practical Logic-Based System , A Deeper Analysis , Logic-Based Modeling , Traveling Salesman Problem , Assignment Problem , Quadratic Assignment Problem , A Job Shop Scheduling Problem , A Knapsack Problem , An Integer Programming Model , An Integer Programming Solution , A Logic-Based Solution , Processing Network Design , An Integer Programming Approach , A Logic-Based Approach , Lot Sizing , An Integer Programming Model , A Logic-Based Model , Logic of Propositions , Idea of Propositional Logic , Formulas , Clauses , Conversion to Clausal Form , Horn Clauses , Renamable Horn Clauses , Resolution , Resolution Algorithm , Projection , Unit Resolution , Constraint-Based Search , Logic of Discrete Variables , Formulas of Discrete-Variable Logic , Formulas and Semantics , Multivalent Clauses , Multivalent Resolution , Full Resolution , Projection , Unit Resolution , Constraint Generation , Defined Predicates , Logic of 0-1 Inequalities , Inequalities and Implication , Resolution for 0-1 Inequalities , Algorithm , Completeness of 0-1 Resolution , Resolution and Cutting Planes , Equivalent Inequalities , Characterizing an Equivalence Class , A Polar Approach to Checking Equivalence , Polar Characterization of Equivalence Classes , Canonical Inequalities , Cardinality Clauses , Resolution for Cardinality Clauses , Classical Resolution Step , Diagonal Summation Step , Generating Cardinality Clauses , Implied Cardinality Clauses , Generating Nonredundant Implications , Implied Contiguous Clauses , Classical Boolean Methods , Pseudoboolean Optimization , Basic Method , Basic Algorithm Revisited , Roof Duality , Roofs , Roof Dual , Implied Constraints , Implications of a Linear 0-1 Inequality , Implications of a Nonlinear 0-1 Inequality , Matching Problems , Logic-Based Modeling , A Modeling Framework , Basic Framework , A Growing Lexicon of Global Constraints , Element Constraints and Variable Subscripts , Sum Constraints and Variable Index Sets , Integer and Mixed Integer Modeling , Objective Function , Some Modeling Examples Revisited , Traveling Salesman, Assignment, and Job Shop Problems , Knapsack Problem , Processing Network Design , Lot-Sizing , Additional Examples , Progressive Party Problem , A Resource-Constrained Scheduling Problem , A Production Scheduling Problem , Logic-Based Branch and Bound , Solution Strategy , Inference , Solution of a Relaxation , Completion of the Solution , Branching , Statement of the Algorithm , Constraint Generation , Consistency and the Dependency Graph , Consistency , Dependency Graph , Constraints and Satisfaction , Consistency and Backtracking , k-Consistency , k-Consistency and Backtracking , Binary Problems , Achieving k-Consistency , Adaptive Consistency , Adaptive Consistency and Backtracking , Achieving Adaptive Consistency , Induced Width and k-Trees , Induced Width and Complexity , Minimum Width Orderings , Finding a Minimum-Width Ordering , Minimum Bandwidth Orderings , Finding a Minimum Bandwidth Ordering , Domain Reduction , Consistency , Arc and Hyperarc Consistency , Bounds Consistency , Element and Sum Constraints , Element Constraint , Sum Constraint , All-Different Constraint , A Combinatorial Algorithm , Domain Reduction as a Matching Problem , Constraint Propagation , Constraint Programming , Development of Constraint Programming , Logic Programming , Basic Idea , A Scheduling Problem , Constraint Logic Programming , Unification as Constraint Solving , A Scheduling Problem , Other Approaches , Continuous Relaxations , Relaxations of Discrete Constraints , Propositional Formulas , Cardinality Rules , All-different Constraints , Relaxations for Mixed Constraints , Weak Continuous Relaxations , Lifted versus Projected Relaxations , Lifted Relaxations , Jeroslow's Representability Theorem , Disjunctions: Big-M Relaxations , Disjunctions: Convex Hull Relaxation , Projected Relaxations , Projection Methods for Linear Systems , Disjunctions: Elementary Inequalities , Disjunctions: Supporting Inequalities , Disjunctions: Optimal Separating Inequalities , Fixed Charge Problems , Piecewise Linear Functions , Element Constraints , Extended Element Constraints , Decomposition Methods , Outer Approximation , Basic Algorithm , Benders Decomposition , Classical Method , Linear Disjunctions , Generalized Benders Decomposition , Nonlinear Disjunctions , Branching Rules , General-Purpose Branching Heuristics , Rationales for the Heuristics , Branching for Logical Clauses , Empirical Behavior of Branching Rules , Jeroslow-Wang Rule , Maximum Satisfiability Hypothesis , A Simplification Hypothesis , First-Fail Heuristics , An Elementary Analysis , A More Refined Analysis , Relaxation Duality , Strengthenings and Relaxations , A Strengthening Strategy , A Relaxation Strategy , Branching , Mixed Strategies , Relaxation of Strengthenings , Strengthenings of a Relaxation , Relaxation Duality , Relaxation Dual , Lagrangean and Surrogate Duals , Inference Duality , Constraint Generation , Constraints as Cuts , Constraint-Based Search , Linear Programming Duality , Linear Inference , Sensitivity , Duality for Logical Clauses , Dual Solution as a Resolution Proof , Recovering a Dual from a Primal Solution , Duality for Horn Clauses , 0-1 Linear Programming Duality , Recovering an INdirect Optimality Proof , Recovering a Direct Optimality Proof , Sensitivity Analysis , Search Strategies , Branching and Constraint-Based Search , Search over Partial Assignments , Branching as Constraint-Based Search , Parallel Resolution Search , Dependency-Directed Backtracking , Backjumping , Backchecking and Backmarking , Dynamic Backtracking , Partial-Order Dynamic Backtracking , Generalized Dynamic Backtracking , Logic-Based Benders Decomposition , Benders Decomposition in the Abstract , A Simple Example , Algorithm , Advantage of Benders Decomposition , Benders Decomposition as Projection , Classical Benders Decomposition , Convergence of Classical Benders , Propositional Satisfiability , 0-1 Linear Programming , Optimization Plus Constraint Satisfaction , Basic Framework , Example: Machine Scheduling , Benders Decomposition for Branching , Mixed Integer Programming , Problems with Relaxation , Nonserial Dynamic Programming , Basic Recursion , A Feasibility Problem , Two Optimization Problems , Formal Development , State Space Transition , Serial Examples , Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Additional Edition: Print version: Hooker, John, 1949- Logic-based methods for optimization. New York : John Wiley & Sons, ©2000 ISBN 0471385212

Language: English

Keywords: Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118033036

UID:

Format: 1 online resource (xvi, 495 pages) : , illustrations

Edition: Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011.

ISBN: 9781118033036 , 1118033035

Note: Front Matter -- Introduction -- Some Examples -- The Logic of Propositions -- The Logic of Discrete Variables -- The Logic of 0-1 Inequalities -- Cardinality Clauses -- Classical Boolean Methods -- Logic-Based Modeling -- Logic-Based Branch and Bound -- Constraint Generation -- Domain Reduction -- Constraint Programming -- Continuous Relaxations -- Decomposition Methods -- Branching Rules -- Relaxation Duality -- Inference Duality -- Search Strategies -- Logic-Based Benders Decomposition -- Nonserial Dynamic Programming -- Discrete Relaxations -- References -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Logic and Optimization , Optimization and Constraint Satisfaction , Constraint Programming , Development of Logic-Based Methods , Recent Applications and Software , Organization of the Book , How Much to Read , Background Material , A Practical Logic-Based System , A Deeper Analysis , Logic-Based Modeling , Traveling Salesman Problem , Assignment Problem , Quadratic Assignment Problem , A Job Shop Scheduling Problem , A Knapsack Problem , An Integer Programming Model , An Integer Programming Solution , A Logic-Based Solution , Processing Network Design , An Integer Programming Approach , A Logic-Based Approach , Lot Sizing , An Integer Programming Model , A Logic-Based Model , Logic of Propositions , Idea of Propositional Logic , Formulas , Clauses , Conversion to Clausal Form , Horn Clauses , Renamable Horn Clauses , Resolution , Resolution Algorithm , Projection , Unit Resolution , Constraint-Based Search , Logic of Discrete Variables , Formulas of Discrete-Variable Logic , Formulas and Semantics , Multivalent Clauses , Multivalent Resolution , Full Resolution , Projection , Unit Resolution , Constraint Generation , Defined Predicates , Logic of 0-1 Inequalities , Inequalities and Implication , Resolution for 0-1 Inequalities , Algorithm , Completeness of 0-1 Resolution , Resolution and Cutting Planes , Equivalent Inequalities , Characterizing an Equivalence Class , A Polar Approach to Checking Equivalence , Polar Characterization of Equivalence Classes , Canonical Inequalities , Cardinality Clauses , Resolution for Cardinality Clauses , Classical Resolution Step , Diagonal Summation Step , Generating Cardinality Clauses , Implied Cardinality Clauses , Generating Nonredundant Implications , Implied Contiguous Clauses , Classical Boolean Methods , Pseudoboolean Optimization , Basic Method , Basic Algorithm Revisited , Roof Duality , Roofs , Roof Dual , Implied Constraints , Implications of a Linear 0-1 Inequality , Implications of a Nonlinear 0-1 Inequality , Matching Problems , Logic-Based Modeling , A Modeling Framework , Basic Framework , A Growing Lexicon of Global Constraints , Element Constraints and Variable Subscripts , Sum Constraints and Variable Index Sets , Integer and Mixed Integer Modeling , Objective Function , Some Modeling Examples Revisited , Traveling Salesman, Assignment, and Job Shop Problems , Knapsack Problem , Processing Network Design , Lot-Sizing , Additional Examples , Progressive Party Problem , A Resource-Constrained Scheduling Problem , A Production Scheduling Problem , Logic-Based Branch and Bound , Solution Strategy , Inference , Solution of a Relaxation , Completion of the Solution , Branching , Statement of the Algorithm , Constraint Generation , Consistency and the Dependency Graph , Consistency , Dependency Graph , Constraints and Satisfaction , Consistency and Backtracking , k-Consistency , k-Consistency and Backtracking , Binary Problems , Achieving k-Consistency , Adaptive Consistency , Adaptive Consistency and Backtracking , Achieving Adaptive Consistency , Induced Width and k-Trees , Induced Width and Complexity , Minimum Width Orderings , Finding a Minimum-Width Ordering , Minimum Bandwidth Orderings , Finding a Minimum Bandwidth Ordering , Domain Reduction , Consistency , Arc and Hyperarc Consistency , Bounds Consistency , Element and Sum Constraints , Element Constraint , Sum Constraint , All-Different Constraint , A Combinatorial Algorithm , Domain Reduction as a Matching Problem , Constraint Propagation , Constraint Programming , Development of Constraint Programming , Logic Programming , Basic Idea , A Scheduling Problem , Constraint Logic Programming , Unification as Constraint Solving , A Scheduling Problem , Other Approaches , Continuous Relaxations , Relaxations of Discrete Constraints , Propositional Formulas , Cardinality Rules , All-different Constraints , Relaxations for Mixed Constraints , Weak Continuous Relaxations , Lifted versus Projected Relaxations , Lifted Relaxations , Jeroslow's Representability Theorem , Disjunctions: Big-M Relaxations , Disjunctions: Convex Hull Relaxation , Projected Relaxations , Projection Methods for Linear Systems , Disjunctions: Elementary Inequalities , Disjunctions: Supporting Inequalities , Disjunctions: Optimal Separating Inequalities , Fixed Charge Problems , Piecewise Linear Functions , Element Constraints , Extended Element Constraints , Decomposition Methods , Outer Approximation , Basic Algorithm , Benders Decomposition , Classical Method , Linear Disjunctions , Generalized Benders Decomposition , Nonlinear Disjunctions , Branching Rules , General-Purpose Branching Heuristics , Rationales for the Heuristics , Branching for Logical Clauses , Empirical Behavior of Branching Rules , Jeroslow-Wang Rule , Maximum Satisfiability Hypothesis , A Simplification Hypothesis , First-Fail Heuristics , An Elementary Analysis , A More Refined Analysis , Relaxation Duality , Strengthenings and Relaxations , A Strengthening Strategy , A Relaxation Strategy , Branching , Mixed Strategies , Relaxation of Strengthenings , Strengthenings of a Relaxation , Relaxation Duality , Relaxation Dual , Lagrangean and Surrogate Duals , Inference Duality , Constraint Generation , Constraints as Cuts , Constraint-Based Search , Linear Programming Duality , Linear Inference , Sensitivity Analysis , Duality for Logical Clauses , Dual Solution as a Resolution Proof , Recovering a Dual from a Primal Solution , Duality for Horn Clauses , 0-1 Linear Programming Duality , Recovering an INdirect Optimality Proof , Recovering a Direct Optimality Proof , Sensitivity Analysis , Search Strategies , Branching and Constraint-Based Search , Search over Partial Assignments , Branching as Constraint-Based Search , Parallel Resolution Search , Dependency-Directed Backtracking , Backjumping , Backchecking and Backmarking , Dynamic Backtracking , Partial-Order Dynamic Backtracking , Generalized Dynamic Backtracking , Logic-Based Benders Decomposition , Benders Decomposition in the Abstract , A Simple Example , Algorithm , Advantage of Benders Decomposition , Benders Decomposition as Projection , Classical Benders Decomposition , Convergence of Classical Benders , Propositional Satisfiability , 0-1 Linear Programming , Optimization Plus Constraint Satisfaction , Basic Framework , Example: Machine Scheduling , Benders Decomposition for Branching , Mixed Integer Programming , Problems with Relaxation , Nonserial Dynamic Programming , Basic Recursion , A Feasibility Problem , Two Optimization Problems , Formal Development , State Space Transition , Serial Examples , Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Additional Edition: Print version: Hooker, John, 1949- Logic-based methods for optimization. New York : John Wiley & Sons, ©2000 ISBN 0471385212

Language: English

Keywords: Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118033036

UID:

Format: 1 online resource (xvi, 495 pages) : , illustrations

Edition: Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011.

ISBN: 9781118033036 , 1118033035

Note: Front Matter -- Introduction -- Some Examples -- The Logic of Propositions -- The Logic of Discrete Variables -- The Logic of 0-1 Inequalities -- Cardinality Clauses -- Classical Boolean Methods -- Logic-Based Modeling -- Logic-Based Branch and Bound -- Constraint Generation -- Domain Reduction -- Constraint Programming -- Continuous Relaxations -- Decomposition Methods -- Branching Rules -- Relaxation Duality -- Inference Duality -- Search Strategies -- Logic-Based Benders Decomposition -- Nonserial Dynamic Programming -- Discrete Relaxations -- References -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Logic and Optimization , Optimization and Constraint Satisfaction , Constraint Programming , Development of Logic-Based Methods , Recent Applications and Software , Organization of the Book , How Much to Read , Background Material , A Practical Logic-Based System , A Deeper Analysis , Logic-Based Modeling , Traveling Salesman Problem , Assignment Problem , Quadratic Assignment Problem , A Job Shop Scheduling Problem , A Knapsack Problem , An Integer Programming Model , An Integer Programming Solution , A Logic-Based Solution , Processing Network Design , An Integer Programming Approach , A Logic-Based Approach , Lot Sizing , An Integer Programming Model , A Logic-Based Model , Logic of Propositions , Idea of Propositional Logic , Formulas , Clauses , Conversion to Clausal Form , Horn Clauses , Renamable Horn Clauses , Resolution , Resolution Algorithm , Projection , Unit Resolution , Constraint-Based Search , Logic of Discrete Variables , Formulas of Discrete-Variable Logic , Formulas and Semantics , Multivalent Clauses , Multivalent Resolution , Full Resolution , Projection , Unit Resolution , Constraint Generation , Defined Predicates , Logic of 0-1 Inequalities , Inequalities and Implication , Resolution for 0-1 Inequalities , Algorithm , Completeness of 0-1 Resolution , Resolution and Cutting Planes , Equivalent Inequalities , Characterizing an Equivalence Class , A Polar Approach to Checking Equivalence , Polar Characterization of Equivalence Classes , Canonical Inequalities , Cardinality Clauses , Resolution for Cardinality Clauses , Classical Resolution Step , Diagonal Summation Step , Generating Cardinality Clauses , Implied Cardinality Clauses , Generating Nonredundant Implications , Implied Contiguous Clauses , Classical Boolean Methods , Pseudoboolean Optimization , Basic Method , Basic Algorithm Revisited , Roof Duality , Roofs , Roof Dual , Implied Constraints , Implications of a Linear 0-1 Inequality , Implications of a Nonlinear 0-1 Inequality , Matching Problems , Logic-Based Modeling , A Modeling Framework , Basic Framework , A Growing Lexicon of Global Constraints , Element Constraints and Variable Subscripts , Sum Constraints and Variable Index Sets , Integer and Mixed Integer Modeling , Objective Function , Some Modeling Examples Revisited , Traveling Salesman, Assignment, and Job Shop Problems , Knapsack Problem , Processing Network Design , Lot-Sizing , Additional Examples , Progressive Party Problem , A Resource-Constrained Scheduling Problem , A Production Scheduling Problem , Logic-Based Branch and Bound , Solution Strategy , Inference , Solution of a Relaxation , Completion of the Solution , Branching , Statement of the Algorithm , Constraint Generation , Consistency and the Dependency Graph , Consistency , Dependency Graph , Constraints and Satisfaction , Consistency and Backtracking , k-Consistency , k-Consistency and Backtracking , Binary Problems , Achieving k-Consistency , Adaptive Consistency , Adaptive Consistency and Backtracking , Achieving Adaptive Consistency , Induced Width and k-Trees , Induced Width and Complexity , Minimum Width Orderings , Finding a Minimum-Width Ordering , Minimum Bandwidth Orderings , Finding a Minimum Bandwidth Ordering , Domain Reduction , Consistency , Arc and Hyperarc Consistency , Bounds Consistency , Element and Sum Constraints , Element Constraint , Sum Constraint , All-Different Constraint , A Combinatorial Algorithm , Domain Reduction as a Matching Problem , Constraint Propagation , Constraint Programming , Development of Constraint Programming , Logic Programming , Basic Idea , A Scheduling Problem , Constraint Logic Programming , Unification as Constraint Solving , A Scheduling Problem , Other Approaches , Continuous Relaxations , Relaxations of Discrete Constraints , Propositional Formulas , Cardinality Rules , All-different Constraints , Relaxations for Mixed Constraints , Weak Continuous Relaxations , Lifted versus Projected Relaxations , Lifted Relaxations , Jeroslow's Representability Theorem , Disjunctions: Big-M Relaxations , Disjunctions: Convex Hull Relaxation , Projected Relaxations , Projection Methods for Linear Systems , Disjunctions: Elementary Inequalities , Disjunctions: Supporting Inequalities , Disjunctions: Optimal Separating Inequalities , Fixed Charge Problems , Piecewise Linear Functions , Element Constraints , Extended Element Constraints , Decomposition Methods , Outer Approximation , Basic Algorithm , Benders Decomposition , Classical Method , Linear Disjunctions , Generalized Benders Decomposition , Nonlinear Disjunctions , Branching Rules , General-Purpose Branching Heuristics , Rationales for the Heuristics , Branching for Logical Clauses , Empirical Behavior of Branching Rules , Jeroslow-Wang Rule , Maximum Satisfiability Hypothesis , A Simplification Hypothesis , First-Fail Heuristics , An Elementary Analysis , A More Refined Analysis , Relaxation Duality , Strengthenings and Relaxations , A Strengthening Strategy , A Relaxation Strategy , Branching , Mixed Strategies , Relaxation of Strengthenings , Strengthenings of a Relaxation , Relaxation Duality , Relaxation Dual , Lagrangean and Surrogate Duals , Inference Duality , Constraint Generation , Constraints as Cuts , Constraint-Based Search , Linear Programming Duality , Linear Inference , Sensitivity Analysis , Duality for Logical Clauses , Dual Solution as a Resolution Proof , Recovering a Dual from a Primal Solution , Duality for Horn Clauses , 0-1 Linear Programming Duality , Recovering an INdirect Optimality Proof , Recovering a Direct Optimality Proof , Sensitivity Analysis , Search Strategies , Branching and Constraint-Based Search , Search over Partial Assignments , Branching as Constraint-Based Search , Parallel Resolution Search , Dependency-Directed Backtracking , Backjumping , Backchecking and Backmarking , Dynamic Backtracking , Partial-Order Dynamic Backtracking , Generalized Dynamic Backtracking , Logic-Based Benders Decomposition , Benders Decomposition in the Abstract , A Simple Example , Algorithm , Advantage of Benders Decomposition , Benders Decomposition as Projection , Classical Benders Decomposition , Convergence of Classical Benders , Propositional Satisfiability , 0-1 Linear Programming , Optimization Plus Constraint Satisfaction , Basic Framework , Example: Machine Scheduling , Benders Decomposition for Branching , Mixed Integer Programming , Problems with Relaxation , Nonserial Dynamic Programming , Basic Recursion , A Feasibility Problem , Two Optimization Problems , Formal Development , State Space Transition , Serial Examples , Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Additional Edition: Print version: Hooker, John, 1949- Logic-based methods for optimization. New York : John Wiley & Sons, ©2000 ISBN 0471385212

Language: English

Keywords: Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118033036