Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions
スポンサーリンク
概要
著者
-
Makino Kazuhisa
Department Of Applied Mathematics And Physics Graduate School Of Engineering Kyoto University
-
Ibaraki Toshihide
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
Bioch Jan
Department of Computer Science, Erasmus University
-
Bioch Jan
Department Of Computer Science Erasmus University
関連論文
- 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
- A Simple Proof of a Minimum Cut Algorithm and Its Applications
- A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns
- 4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)
- A Note on Approximating the Survivable Network Design Problem in Hypergraphs(Special Issue on Selected Papers from LA Symposium)
- An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns
- Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge(Discrete Mathematics and Its Applications)
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- A Fast Algorithm for Cactus Representations of Minimum Cuts
- Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree (Special Section on Discrete Mathematics and Its Applications)
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- 1A1 Scheduling of Corrugated Paper Production(Technical session 1A: Combinatorial optimization)
- A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
- AN ASSIGNMENT PROBLEM ON A NETWORK
- MINIMUM DELAY SEMIJOIN SCHEDULES FOR LOCAL AREA DISTRIBUTED DATABASE SYSTEMS(Mathematical Theories on Computing Schemes and Their Applications)
- Approximability of the Minimum Maximal Matching Problem in Planar Graphs(Graphs and Networks)
- An Approximation of the Minimum Vertex Cover in a Graph
- Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions
- ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
- PARTIALLY DEFINED BOOLEAN FUNCTIONS WITH APPLICATIONS TO DATA ANALYSIS : A SURVEY
- Computing knapsack solutions with cardinality robustness