Logic-Based 0–1 Constraint Programming

· Operations Research/Computer Science Interfaces Series Livro 5 · Springer Science & Business Media
E-book
254
Páginas
As notas e avaliações não são verificadas Saiba mais

Sobre este e-book

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.

Avaliar este e-book

Diga o que você achou

Informações de leitura

Smartphones e tablets
Instale o app Google Play Livros para Android e iPad/iPhone. Ele sincroniza automaticamente com sua conta e permite ler on-line ou off-line, o que você preferir.
Laptops e computadores
Você pode ouvir audiolivros comprados no Google Play usando o navegador da Web do seu computador.
eReaders e outros dispositivos
Para ler em dispositivos de e-ink como os e-readers Kobo, é necessário fazer o download e transferir um arquivo para o aparelho. Siga as instruções detalhadas da Central de Ajuda se quiser transferir arquivos para os e-readers compatíveis.