Search

Abstract. Closeness centrality is a class of distance-based measures in the network analysis literature to quantify reachability of a given vertex (or a group of vertices) by other network agents. [...]

Abstract. The most common approach to generate cuts in integer programming is to derive them from the linear programming relaxation. We study an alternative approach that extracts cuts from discrete [...]

Abstract. The problem of designing a spanning tree on an underlying graph to minimize the flow costs of a given set of traffic demands is considered. Several new classes of [...]

Abstract. In this article we consider the network design problem with relays (NDPR), which gives answers to some important strategic design questions in telecommunication network design. Given a family of [...]

Abstract. In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a [...]

Abstract. Influenza (flu) is a serious public health concern. The first line of defense is the flu shot, whose composition is updated annually to adjust for frequent mutations of the [...]

Abstract. In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of the techniques [...]

Abstract. Detailed modeling of gas transport problems leads to nonlinear and nonconvex mixed-integer optimization or feasibility models (MINLPs) because both the incorporation of discrete controls of the network and accurate [...]

Abstract. We investigate the maximum induced matching problem (MIM), which is the problem of finding an induced matching having the largest cardinality on an undirected graph. The problem is known [...]

Abstract. Recently, parallel computing environments have become significantly popular. In order to obtain the benefit of using parallel computing environments, we have to deploy our programs for these effectively. This [...]

Abstract. The U.S. Navy operates an impressive fleet of nuclear-powered submarines and aircraft carriers and has safely operated its nuclear fleet for more than 60 years, while steaming over 154 [...]

Abstract. The resolution of integer programming problems is typically performed via branch and bound. Nodes of the branch-and-bound tree are pruned whenever the corresponding subproblem is proven not to contain [...]

Abstract. The coupled lot-sizing and cutting-stock problem has been a challenging and significant problem for industry, and has therefore received sustained research attention. The quality of the solution is a [...]

Abstract. We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1 knapsack problem, in which a conflict graph describing incompatibilities between items is given. The goal [...]

Abstract. We consider the dynamic facility location problem with generalized modular capacities, a multiperiod facility location problem in which the costs for capacity changes may differ for all pairs of [...]

Abstract. In this paper, we study a multisourcing supply network design problem, in which each retailer faces uncertain demand and can source products from more than one distribution center (DC). [...]

Abstract. For the past 12 years, the Chilean Professional Soccer Association (ANFP) has applied operations research (OR) techniques to schedule soccer leagues in Chile. Using integer programming-based methods, the ANFP [...]

Despite the significant attention they have drawn, big-bucket lot-sizing problems remain notoriously difficult to solve. Previous literature contained results (computational and theoretical) indicating that what makes these problems difficult are [...]

Many patients face difficulties when accessing medical facilities, particularly in rural areas. To alleviate these concerns, medical centers may offer transportation to eligible patients. However, the operation of such services [...]

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Given the nonconvex nature of gas transmission constraints, global optimality and infeasibility guarantees [...]

We investigate modeling approaches and exact solution methods for a generalized assignment problem with location/allocation (GAPLA) considerations. In contrast with classical generalized assignment problems, each knapsack in GAPLA is discretized [...]

This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in several applications including retail shelf space allocation. We consider a set of items where [...]

In this paper we propose a methodology for constructing decision rules for integer and continuous decision variables in multiperiod robust linear optimization problems. This type of problem finds application in, [...]

We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes [...]

We study the ambulance relocation problem in which one tries to respond to possible future incidents quickly. For this purpose, we consider compliance table policies: a relocation strategy commonly used [...]

We consider a bilevel integer programming model that extends the classic 0-1 knapsack problem in a very natural way. The model describes a Stackelberg game where the leader's decision interdicts [...]

In this work, we propose a cutting plane algorithm to improve optimization models that are originally formulated as convex generalized disjunctive programs. Generalized disjunctive programs are traditionally reformulated as mixed-integer [...]

Column generation (CG) models have several advantages over compact formulations: they provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities in their subproblems. However, users also encounter [...]

We study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times and the objective of makespan minimization. Two exact decomposition-based methods are proposed based on logic-based Benders [...]

Branch-and-price algorithms combine a branch-and-bound search with an exponentially sized LP formulation that must be solved via column generation. Unfortunately, the standard branching rules used in branch and bound for [...]

We propose a multistage stochastic mixed-integer programming formulation for the assignment of surgeries to operating rooms over a finite planning horizon. We consider the demand for and the duration of [...]

We present a new criterion space search algorithm, the balanced box method, for finding all nondominated points of a biobjective integer program. The method extends the box algorithm, is easy [...]

We present the first criterion space search algorithm, the triangle splitting method, for finding all nondominated points of a biobjective mixed integer program. The algorithm is relatively easy to implement [...]

Automatic layout of tables is useful in word processing applications and is required in online applications because of the need to tailor the layout to viewport width, choice of font, [...]

The College of Business and Economics at Bahir Dar University, Ethiopia has had phenomenal growth during the past 10 years. This aligns with Ethiopia's aggressive higher education expansion policy. With [...]

The national broadband network (NBN) is the largest public infrastructure project undertaken in Australia, and NBN Co is the government-owned company responsible for building the network. By using operations research, [...]

We describe a software application that enables owners of generation output from a virtualized Federal Columbia River Power System to safely operate the system, while also shaping the generation to [...]

This paper considers the minimum k-connected d-dominating set problem, which is a fault-tolerant generalization of the minimum connected dominating set (MCDS) problem. Three integer programming formulations based on vertex cuts [...]

In this paper, we extend our former investigation on conceiving reliable fixed point-to-point wireless networks under outage probability constraints. We consider the problem of determining the minimum cost bandwidth assignment [...]

In this paper, we study whether cuts obtained from two simplex tableau rows at a time can strengthen the bounds obtained by Gomory mixed-integer (GMI) cuts based on single tableau [...]

We consider a class of packing problems with uncertain data, which we refer to as the chance-constrained binary packing problem. In this problem, a subset of items is selected that [...]

Branch-and-price algorithms for the graph coloring problem use an exponentially sized independent set-based integer programming formulation to produce usually tight lower bounds to enable more aggressive pruning in the branch-and-bound [...]

Solution methods are presented for a mixed-integer program (MIP) associated with a method for constrained discrimination. In constrained discrimination, one wishes to maximize the probability of correct classification subject to [...]

Matching is widely used in the estimation of treatment effects in observational studies. However, the matching paradigm may be too restrictive in many cases because exact matches often do not [...]

We consider a class of linear programs involving a set of covering constraints of which at most k are allowed to be violated. We show that this covering linear program [...]

This paper addresses the static aircraft sequencing problem over a mixed-mode single runway (or closely interacting parallel runways), which commonly constitutes a critical bottleneck at airports. In contrast with disjunctive [...]

We address a variant of the Euclidean traveling salesman problem known as the close-enough traveling salesman problem (CETSP), where the traveler visits a node if it enters a compact neighborhood [...]

Recommender systems are being used to help users find relevant items from a large set of alternatives in many online applications. Most existing recommendation techniques have focused on improving recommendation [...]

Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of a linear programming tableau, we report on computational tests to evaluate the strength [...]

Proportional symbol maps are a cartographic tool to assist in the visualization and analysis of quantitative data associated with specific locations, such as earthquake magnitudes, oil well production, and temperature [...]