Logic-Based 0–1 Constraint Programming(Operations Research/Computer Science Interfaces Series)

数量经济学

原   价:
2355.00
售   价:
1884.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
1995年11月30日
装      帧
精装
ISBN
9780792396635
复制
页      码
254
开      本
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 100 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches.
Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个