5 Result(s)
-
Article
An overview of ORP \(^3\) -OR for young researchers and practitioners
-
Article
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
The Maximum Benefit Chinese Postman Problem (MBCPP) is an NP-hard problem that considers several benefits associated with each edge, one for each time the edge is traversed with a service. The objective is to ...
-
Article
On discrete optimization with ordering
This paper studies discrete optimization problems with ordering requirements. These problems are formulated on general discrete sets in which there exists an ordering on their elements together with a cost fun...
-
Article
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem
An alternative formulation for the set packing problem in a higher dimension is presented. The addition of a new family of binary variables allows us to find new valid inequalities, some of which are shown to ...
-
Article
On the structure of the solution set for the single facility location problem with average distances
This paper analyzes continuous single facility location problems where the demand is randomly defined by a given probability distribution. For these types of problems that deal with the minimization of average...
