We show that approximate graph colouring is not solved by constantly many levels of the lift-
and-project hierarchy for the combined basic linear programming and affine integer …

Transportation matrices are $ m\times n $ non-negative matrices whose row sums and row
columns are equal to, or dominated above with given integral vectors $ R $ and $ C …

Indivisible resource allocation motivates us to study the matrix completion concerning the
class of (0, 1)-matrices with prescribed row/column sums and preassigned zeros. We …

With the high penetration of renewable energy, the conventional solution to balancing
supply and demand requires substantial reserve generations and, thus, curtails the …

An increasing concern in power systems is how to elicit flexibilities in demand, which leads
to nontraditional electricity products for accommodating loads of different flexibility levels …

We propose and examine two optimal $(0, 1) $-matrix completion problems with
majorization ordered objectives. They elevate the seminal study by Gale and Ryser from …

In this paper, we analyze the existence conditions of a special class of constrained zero-one
matrices with uncertainties. Classically, it asks how to characterize a class of zeroone …

The supply/demand balance problem plays a pivotal role in the electricity grid, especially
when an increasing proportion of power is generated from renewable resources. Enormous …

We show that approximate graph colouring is not solved by constantly many levels of the
liftand-project hierarchy for the combined basic linear programming and affine integer …

With an increasing amount of renewable energy generation, the scheme of supply following
demand is no longer viable. As a consequence, aggregating entities (eg, utilities, service …