Computers and Operations Research

• Update of the literature review devoted to blood supply chain with an improved taxonomy.

The management of the blood supply chain is considered of vital importance. The unavailability of blood may cause deaths and complications for patients. Conversely, wastage of blood generates high costs. Optimal decision making in the ...

• Exploiting the return and bias cause-and-effect relations within behavioral stocks.

This study exploits the extra information provided by behavioral stocks (B-stocks) and proposes portfolio selection models that produce profitable portfolios which can outperform traditional investment benchmarks (market index, mutual ...

• Provide the first dedicated heuristic algorithm for the commodity constrained split delivery vehicle routing problem (C-SDVRP) based on an adaptive large ...

This paper addresses the commodity constrained split delivery vehicle routing problem (C-SDVRP) where customers require multiple commodities. This problem arises when customers accept to be delivered separately. All commodities can be ...

• We study multi-objective mixed integer linear programs.
• We develop a generic ...

Feasibility pump is one of the successful heuristics developed almost a decade ago for computing high-quality feasible solutions of single-objective integer linear programs, and it is implemented in exact commercial solvers such as ...

• Study an appointment scheduling problem in general multi-stage sequential service systems.

We consider an appointment scheduling problem in multi-stage sequential service systems, in which the decision maker has to determine an appointment time for each customer in the first stage to minimize the total expected weighted ...

• Introduction of the station capacity in the Green Vehicle Routing Problem.
• ...

In this paper, we introduce the Green Vehicle Routing Problem with capacitated Alternative Fuel Stations (AFSs), a more realistic variant of the Green Vehicle Routing Problem where the capacity of the AFSs is addressed. Two Mixed ...

• We provide two integer programming formulations that detects components states in a failed k-outof-n system.

This paper considers a k-out-of-n system that has just failed. There is an associated cost of testing each component. In addition, we have apriori information regarding the probabilities that a certain set of components is the reason ...

• Studying mixed blocking flowshop scheduling problems (MBPFSP).
• Makespan and ...

Blocking constraints are ubiquitous in machine scheduling. In a flowshop scenario, a machine might get blocked by a job that has just been processed by the same machine. This happens when there is no buffer where the job can ...

• We jointly optimize container loading and operation scheduling at intermodal logistics platforms.

We consider the optimization of container loading at three intermodal logistics platforms (ILP) of a large European car manufacturer (ECM). The decisions focus both on the loading day of each container and on its filling with the ...

• Stochastic transitivity can be extended to incorporate ties and home/away asymmetries.

We seek to find the statistical model that most accurately describes empirically observed results in sports. This model has only two assumptions: a trinomial distribution of outcomes and a transitive relationship between these ...

• A row and column generation algorithm for finding the nucleolus is introduced.
• ...

This paper introduces a row and column generation algorithm for finding the nucleolus, based on a linear programming model proposed in an earlier research. Since this approach cannot return an allocation for large games, we also ...

• Equivalent representations of a quadratic combinatorial optimization problem is studied and its linkages with linearization and constant value property are ...

The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented using two data items, a quadratic cost matrix Q and a linear cost vector c ...

• We provide a detailed description to embed the FF tie-breaking mechanism into the IG.

In this paper, we analyse several issues concerning the most efficient approximate algorithms for the permutation flowshop scheduling problem with makespan objective. On the one hand, it is not clear which algorithm obtains the best ...

• A new class of inequalities called set union knapsack cover were introduced
• ...

We consider the incremental connected facility location problem (incremental ConFL), in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each ...

• Multi-objective Traveling Salesman or Repairman Problem with different scenarios.

This paper analyzes a multi-objective variant of the well-known Traveling Salesman Problem (TSP) and the Traveling Repairman Problem (TRP) in order to address the classical conflict between cost minimization (represented by the TSP) ...

• The Angular Constrained Minimum Spanning Tree Problem is investigated.
• A ...

Assume one is given an angle α ∈ (0, 2π] and a complete undirected graph G = ( V , E ). The vertices in V represent points in the Euclidean plane. The edges in E represent the line segments between these points, with edge weights equal ...

• New Combinatorial Optimization Model for the Air Traffic Flow Management problem.

In this paper we introduce a new 0–1 mathematical formulation for the Air Traffic Flow Management problem. The model is based on a 4D-graph, which allows us to consider the problem not as general combinatorial one, but as a set of ...

• The problem arises in many real-world industrial applications.
• Objective is to ...

Cutting phases occur in many production processes when a larger object must be cut into multiple smaller pieces. Some examples of relevant industries being clothing, footwear, metalware and furniture. The cutting phase is composed of ...