rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Logic-based methods for optimization
    sub title: combining optimization and constraint satisfaction
  name:
    name part: Hooker, John
    name part: 1949-
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: nyu
    place:
      place term: New York
    publisher: John Wiley & Sons
    date issued: ©2000
    date issued: 2000
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xvi, 495 pages) : illustrations
  table of contents: 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.
  table of contents: 1.1 Logic and Optimization 1 -- 1.1.1 Optimization and Constraint Satisfaction 2 -- 1.1.2 Constraint Programming 4 -- 1.1.3 Development of Logic-Based Methods 6 -- 1.1.4 Recent Applications and Software 8 -- 1.2 Organization of the Book 9 -- 1.2.1 How Much to Read 9 -- 1.2.2 Background Material 11 -- 1.2.3 A Practical Logic-Based System 12 -- 1.2.4 A Deeper Analysis 12 -- 2.1 Logic-Based Modeling 16 -- 2.1.1 Traveling Salesman Problem 17 -- 2.1.2 Assignment Problem 18 -- 2.1.3 Quadratic Assignment Problem 19 -- 2.1.4 A Job Shop Scheduling Problem 20 -- 2.2 A Knapsack Problem 23 -- 2.2.1 An Integer Programming Model 23 -- 2.2.2 An Integer Programming Solution 24 -- 2.2.3 A Logic-Based Solution 27 -- 2.3 Processing Network Design 31 -- 2.3.1 An Integer Programming Approach 32 -- 2.3.2 A Logic-Based Approach 33 -- 2.4 Lot Sizing 37 -- 2.4.1 An Integer Programming Model 38 -- 2.4.2 A Logic-Based Model 39 -- 3 Logic of Propositions 43 -- 3.1 Idea of Propositional Logic 44 -- 3.1.1 Formulas 44 -- 3.1.2 Clauses 45 -- 3.1.3 Conversion to Clausal Form 47 -- 3.1.4 Horn Clauses 48 -- 3.1.5 Renamable Horn Clauses 50 -- 3.2 Resolution 53 -- 3.2.1 Resolution Algorithm 53 -- 3.2.2 Projection 55 -- 3.2.3 Unit Resolution 57 -- 3.2.4 Constraint-Based Search 59 -- 4 Logic of Discrete Variables 61 -- 4.1 Formulas of Discrete-Variable Logic 62 -- 4.1.1 Formulas and Semantics 62 -- 4.1.2 Multivalent Clauses 62 -- 4.2 Multivalent Resolution 63 -- 4.2.1 Full Resolution 63 -- 4.2.2 Projection 65 -- 4.2.3 Unit Resolution 65 -- 4.2.4 Constraint Generation 66 -- 4.3 Defined Predicates 67 -- 5 Logic of 0-1 Inequalities 69 -- 5.1 Inequalities and Implication 70 -- 5.2 Resolution for 0-1 Inequalities 73 -- 5.2.1 Algorithm 73 -- 5.2.2 Completeness of 0-1 Resolution 74 -- 5.2.3 Resolution and Cutting Planes 76 -- 5.3 Equivalent Inequalities 78 -- 5.3.1 Characterizing an Equivalence Class 78 -- 5.3.2 A Polar Approach to Checking Equivalence 79 -- 5.3.3 Polar Characterization of Equivalence Classes 8…
  table of contents: Partial Assignments 363 -- 18.1.2 Branching as Constraint-Based Search 367 -- 18.1.3 Parallel Resolution Search 369 -- 18.2 Dependency-Directed Backtracking 376 -- 18.2.1 Backjumping 376 -- 18.2.2 Backchecking and Backmarking 380 -- 18.3 Dynamic Backtracking 382 -- 18.3.1 Partial-Order Dynamic Backtracking 384 -- 18.3.2 Generalized Dynamic Backtracking 385 -- 19 Logic-Based Benders Decomposition 389 -- 19.1 Benders Decomposition in the Abstract 391 -- 19.1.1 A Simple Example 392 -- 19.1.2 Algorithm 394 -- 19.1.3 Advantage of Benders Decomposition 396 -- 19.1.4 Benders Decomposition as Projection 396 -- 19.2 Classical Benders Decomposition 399 -- 19.2.1 Convergence of Classical Benders 401 -- 19.3 Propositional Satisfiability 402 -- 19.4 0-1 Linear Programming 408 -- 19.5 Optimization Plus Constraint Satisfaction 414 -- 19.5.1 Basic Framework 414 -- 19.5.2 Example: Machine Scheduling 415 -- 19.6 Benders Decomposition for Branching 418 -- 19.6.1 Mixed Integer Programming 419 -- 19.6.2 Problems with Relaxation 419 -- 20 Nonserial Dynamic Programming 423 -- 20.1 Basic Recursion 424 -- 20.1.1 A Feasibility Problem 424 -- 20.1.2 Two Optimization Problems 427 -- 20.1.3 Formal Development 429 -- 20.2 State Space Transition 432 -- 20.2.1 Serial Examples 433.
  note: John Hooker.
  note: Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011. MiAaHDL
  note: 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. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
  note: digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL
  note: Includes bibliographical references (pages 463-481) and index.
  subject:
    topic: Linear programming
  subject:
    topic: Mathematical optimization
  subject:
    topic: Logic, Symbolic and mathematical
  subject:
    topic: Programming, Linear
  classification: T57.74 .H66 2000
  classification: 519.7/2
  classification: 31.80
  related item:
    title info:
      title: Logic-based methods for optimization
    name:
      name part: Hooker, John, 1949-
    origin info:
      publisher: New York : John Wiley & Sons, ©2000
    identifier: (DLC) 99088732
  identifier: 9781118033036
  identifier: 1118033035
  identifier: 0471385212
  identifier: 9780471385219
  identifier: 10.1002/9781118033036 Wiley InterScience
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: NhCcYBP
    record creation date: 111117
    record change date: 20260214234002.1
    record identifier: in00004679722
    language of cataloging:
      language term: eng