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...

In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several varian...

Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...

We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nonde...

In this article we address the model order reduction problem for resistor networks by using methods from graph theory. We formulate this problem through gr...

Let \(G\) be a connected graph, \(n\) the order of \(G\), and \(f\) (resp. \(t\)) the maximum order of an induced forest (resp. tree) in \(G\). ...

We propose an interior-point algorithm based on an elastic formulation of the \(\ell_1\)-penalty merit function for mathematical programs with complementar...

Carbon leakage and competitiveness concerns are some of the main reasons why an international environmental agreement is lacking to fight climate change. M...

It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....

Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear ...

Given a graph <i>G</i> and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divid...

Parameterizing source code for architecture-bound optimization is a common approach to high-performance programming but one that makes the programmer's task ...

In the service industry, the employees perform work shifts and are assigned to interruptible activities and uninterruptible tasks during their shifts. The ...