基于sat的二维条形布局问题求解方法

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae Pub Date : 2010-08-01 DOI:10.5555/1890507.1890516

SohTakehide, InoueKatsumi, TamuraNaoyuki, BanbaraMutsunori, NabeshimaHidetomo

引用次数: 0

摘要

本文提出了一种基于满足性测试(SAT)的精确求解二维条形包装问题的方法。在这个问题中，我们有一组矩形和一个大矩形…

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangl...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fundamenta Informaticae 工程技术-计算机：软件工程

CiteScore

2.00

自引率

0.00%

发文量

审稿时长

9.8 months

期刊介绍： Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing: solutions by mathematical methods of problems emerging in computer science solutions of mathematical problems inspired by computer science. Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, algebraic and categorical methods.