Implementations of the Simplex method differ only in very specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer ...

The analytic center cutting plane method and its proximal variant are well known techniques for solving convex programming problems. We propose two seq...

A game theoretical model featuring a manufacturer and two dealers is proposed to investigate the effects of downstream horizontal integration on network perf...

We consider a Closed-loop supply chain (CLSC) with a single manufacturer and a single retailer. We characterize and compare the feedback equilibrium resul...

A significant game-theoretic literature on the coordination of distribution channels has developed over the past three decades. We provide an extensive analy...

In an onshore oil field, the productivity of oil wells decreases when they require maintenance. To restore full productivity at a well, it must be visi...

We introduce a signless Laplacian for the distance matrix of a connected graph, called the <i>distance signless Laplacian</i>. We study the <i>distance signl...

We introduce a Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and we study its spectrum. We show the equivalenc...

We consider a duopoly competing in quantity, where firms can invest in both innovative and absorptive R&D to reduce their unit production cost, and where t...

We investigate the dynamic effect that the Tandroy's unsustainable practices have on the forest. The Tandroy people lives in Androy, a region located in th...

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the or...

The Job Grouping Problem consists of assigning a set of jobs, each with a specific set of tool requirements, to machines with a limited tool capacity in orde...

Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...

The min-max <i>k</i>-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle in order to find a set of b...

Modularity maximization is extensively used to detect communities in complex networks. It has been shown however that this method suffers from a resolution l...

We study the problem of packing equal circles in a square from the mathematical programming point of view. We discuss different formulations, we analyse fo...

In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E <b>83</b>, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the...

Organizational behavior and stakeholder processes continually influence energy strategy choices and decisions. Although theoretical optimizations can provide...

Climate change is one of the greatest challenges facing our planet in the foreseeable future and despite the urgency of the situation global GHG emissions ...

We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...