The application of automated reasoning to formal models of combinatorial optimization
From MaRDI portal
Publication:1854978
DOI10.1016/S0096-3003(99)00249-0zbMath1032.90035OpenAlexW1982045205WikidataQ127517130 ScholiaQ127517130MaRDI QIDQ1854978
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(99)00249-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The principle of optimality in the design of efficient algorithms
- Set theory in first-order logic: Clauses for Gödel's axioms
- The linked inference principle. I: The formal treatment
- On the optimality of algorithms for finite state sequential decision processes
- Complexity and related enhancements for automated theorem-proving programs
- Solution of the Robbins problem
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- The application of automated reasoning to formal models of combinatorial optimization
- Using hints to increase the effectiveness of an automated reasoning program: Case studies
- Solvable classes of discrete dynamic programming
- Greedoids and Linear Objective Functions
- A common schema for dynamic programming and branch and bound algorithms
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Branch-and-bound procedure and state—space representation of combinatorial optimization problems
- An Exact Characterization of Greedy Structures
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- A Machine-Oriented Logic Based on the Resolution Principle
- Finite-State Processes and Dynamic Programming
- The Concept of Demodulation in Theorem Proving
- Matroids and the greedy algorithm
This page was built for publication: The application of automated reasoning to formal models of combinatorial optimization
