Solving systems of difference constraints incrementally

DOI10.1007/PL00009261MaRDI QIDQ1283935zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 30 March 1999

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009261

zbMATH Keywords

difference constraints systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Solving systems of difference constraints incrementally with bidirectional search
• scientific article; zbMATH DE number 1107729
• On-line algorithms for networks of temporal constraints
• Incremental constraint deletion in systems of linear constraints
• scientific article; zbMATH DE number 5182607

Cited in

(13)

• Integrating answer set programming and constraint logic programming
• Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
• Solving systems of difference constraints incrementally with bidirectional search
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• The Linear Complementarity Problems with a Few Variables per Constraint
• An ASP-based solver for parametrized-difference revision
• Planning wireless networks by shortest path
• scientific article; zbMATH DE number 5182607 (Why is no real title available?)
• Theory and Applications of Models of Computation
• A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
• Incremental constraint deletion in systems of linear constraints
• On approximating optimal weight ``no-certificates in weighted difference constraint systems
• Maintaining longest paths incrementally

This page was built for publication: Solving systems of difference constraints incrementally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283935)