Since the surface operation of hub airports was facing severe congestion and aircraft delay under de-icing mode, some practical problems improving support efficiency are put forward. A two-phase model is constructed to coordinate scheduling (ASO) resources (DSRO). An optimized method used schedule operation. On basis results operation, an resource collaborative (ADCS) mechanism established opti...

We investigate a new application of DC (Difference of Convex functions) programming and DCA (DC Algorithm) in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reform...

Due to recent advances in the development of linear programming solvers, some of the formerly considered difficult multicommodity problems can today be solved in few minutes, even faster than with specialized methods. However, for other kind of multicommodity instances, general linear solvers can still be quite inefficient. In this paper we will give an overview of the current state-of-the-art ...

The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrixQ and a linear cost vector c. Different, but equivalent, representations of the pair (Q,c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positiv...

Online social networks provide large amount of valuable data and may serve as research platforms for various social network analysis tools. In this study, we propose a mathematical model for efficient exploration of an online social network. The goal is to spend minimal amount of time searching for characteristics which define a sub-network of users sharing the same interest or having certain c...

We consider the three-stage two-dimensional bin packing problem (2BP) which occurs in real-world applications such as glass, paper, or steel cutting. We present new integer linear programming formulations: Models for a restricted version and the original version of the problem are developed. Both involve polynomial numbers of variables and constraints only and effectively avoid symmetries. Thos...

The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, but various approximate algorithms have been developed. Linear programming (LP) relaxations are a standard method in computer science for approximating combinatorial problems and have been used for finding the most proba...

This paper presents a conceptual framework and a mathematical formulation for software resource allocation and project selection at the level of software skills. First, we introduce a skill-based framework that considers universities, software companies, and potential projects of a country. Based on this framework, we formulate a linear integer program PMax which determines the selection of pro...

We empirically study the exponential potential function (EPF) approach to linear programming (LP), as applied to optimizing content placement in a video-on-demand (VoD) system. Even instances of modest size (e.g., 50 servers and 20k videos) stretch the capabilities of LP solvers such as CPLEX. These are packing LPs with block-diagonal structure, where the blocks are fractional uncapacitated fac...