Binary matrix factorisations under Boolean arithmetic

Binary matrix factorisations under Boolean arithmetic

<p>For a binary matrix <strong>X</strong>, the Boolean rank <em><strong>br</em></strong>(<strong>X</strong>) is the smallest integer for which <strong>X</strong> can be factorised into the Boolean matrix product of two binary matrices...

Descripció completa

Dades bibliogràfiques
Autor principal:	Kovács, RA
Altres autors:	Hauser, RA
Format:	Thesis
Idioma:	English
Publicat:	2023
Matèries:	Integer programming Linear programming Graph theory Combinatorics Mathematical optimization Combinatorial optimization

Ítems similars

Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings /
per: Conference on Integer Programming and Combinatorial Optimization (12th : 2007 : Ithaca, New York), et al.
Publicat: (2007)

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
per: Román Anselmo Mora Gutiérrez, et al.
Publicat: (2016-08-01)

Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
per: Kuncak, Viktor
Publicat: (2007)

A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions
per: Miroslav M. Dimitrov
Publicat: (2021-01-01)

A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
per: Pop Petrica, et al.
Publicat: (2011-01-01)

Optimization and mathematical modeling in computer architecture /
per: Nowatzki, Tony, author, et al.
Publicat: (2014)

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem
per: Mhand Hifi, et al.
Publicat: (2015-12-01)

Concepts of Combinatorial Optimization /
per: Paschos, Vangelis Th., editor
Publicat: (2014)

Paradigms of combinatorial optimization : problems and new approaches /
per: Paschos, Vangelis Th.
Publicat: (c201)

Applications of Combinatorial Optimization /
per: Paschos, Vangelis Th., author
Publicat: (2014)

Combinatorial optimization /
per: Paschos, Vangelis Th.
Publicat: (c201)

Variable deletion in multi-dimensional multiple-choice knapsack problems /
per: 236988 Walker, John
Publicat: (1996)

Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem
per: José Alejandro Cornejo Acosta, et al.
Publicat: (2020-09-01)

Binary Integer Programming for University Timetabling (The Case: Faculty of Administrative Sciences and Economics of Esfahan University)
per: Majid Esmaelian, et al.
Publicat: (2016-09-01)

On some interconnections between combinatorial optimization and extremal graph theory
per: Cvetković Dragoš M., et al.
Publicat: (2004-01-01)

Minimum cost network flows: Problems, algorithms, and software
per: Sifaleras Angelo
Publicat: (2013-01-01)

Combinatorial and global optimization /
per: Pardalos, Panos M., et al.
Publicat: (2002)

Applications of Metaheuristics Inspired by Nature in a Specific Optimisation Problem of a Postal Distribution Sector
per: Michał Berliński, et al.
Publicat: (2022-09-01)

A Mathematical Model for Reduction of Trim Loss in Cutting Reels at a Make-to-Order Paper Mill
per: Razaullah Khan, et al.
Publicat: (2020-07-01)

Combinatorial Programming : methods and applications /
per: 364844 Roy, B
Publicat: (1974)

Multicommodity Network Flows: A Survey, Part I: Applications and Formulations
per: I-Lin Wang
Publicat: (2018-12-01)

Multicommodity Network Flows: A Survey, Part II: Solution Methods
per: I-Lin Wang
Publicat: (2018-12-01)

Binary Integer Formulations for Task Allocation and Optimal Labor Cost in Small and Medium Apparel Manufacturing
per: Vi Nguyen, et al.
Publicat: (2023-06-01)

The political districting of Kuwait: Heuristic approaches
per: SHAFIQAH ALAWADHI, et al.
Publicat: (2015-06-01)

The Set Covering and Other Problems: An Empiric Complexity Analysis Using the Minimum Ellipsoidal Width
per: Ivan Derpich, et al.
Publicat: (2023-06-01)

On solving Travelling Salesman Problem with Vertex Requisitions
per: Eremeev Anton V., et al.
Publicat: (2017-01-01)

Graphs, networks and algorithms /
per: 382240 Jungnickel, Dieter
Publicat: (2005)

Graphs, networks and algorithms /
per: 309977 Jungnickel, D. (Dieter), 1952-
Publicat: (2008)

Multi-Objective Combinatorial Optimization of Trigeneration Plants Based on Metaheuristics
per: Mirko M. Stojiljković, et al.
Publicat: (2014-12-01)

Combinatorial methods of discrete programming /
per: 341738 Kovacs, Laszlo Bela
Publicat: (1980)

Multisource weber problem using genetic algorithm /
per: 334789 Tew, Yen Ying
Publicat: (2006)

Multisource weber problem using genetic algorithm [compact disc] /
per: 334789 Tew, Yen Ying
Publicat: (2006)

A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs
per: Zelda B. Zabinsky, et al.
Publicat: (2013-09-01)

6.251J / 15.081J Introduction to Mathematical Programming, Fall 2002
per: Tsitsiklis, John
Publicat: (2002)

The mathematical life of Pierre Leroux
per: Gilbert Labelle
Publicat: (2021-04-01)

AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
per: Oustry, Antoine
Publicat: (2022-11-01)

Theoretical aspects of local search /
per: 276130 Michiels, Wil, et al.
Publicat: (2007)

Dynamic parking space allocation at urban scale: Problem formulation and resolution
per: Hanae Errousso, et al.
Publicat: (2022-11-01)

Providing a Mathematical Model for Solving the Problem of Timetabling of Periodical Services
per: Alireza Naser Sadrabadi, et al.
Publicat: (2020-02-01)

An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
per: Tamer F. Abdelmaguid
Publicat: (2018-09-01)