1 Contributo su Rivista

1 Contributo su Rivista: [8571] Home page macrotipologia

Sfoglia

Prodotti recenti

Pricing-based primal and dual bounds for selected packing problems

LP-based dual bounds for the maximum quasi-clique problem

A γ-quasi-clique is a simple and undirected graph with edge density of at least γ. Given a graph G, the maximum γ-quasi-clique problem (γ-QCP) consists of finding an induced γ-quasi-clique with the maximum number of vertices. γ-QCP generalizes the well-known maximum clique problem and its solution is useful for detecting dense subgraphs. After reviewing known integer linear programming formulations and dual bounds for γ-QCP, a new formulation obtained by decomposing star inequalities and comb...

A novel approach for multi-stage investment decisions and dynamic variations in medium-term energy planning for multi-energy carriers community

So far, energy planning methods faced several challenges in achieving a proper assessment due to the extreme variability of input conditions. To considerably decrease the computational efforts in achieving solutions, most of the analyses reported in the scientific literature assume constant costs and demand over the entire planning horizon in a typical year. However, results might not be perfectly aligned with real ones because of the incapability of some models to address several aspects lik...

Number of bins and maximum lateness minimization in two-dimensional bin packing

In this work we address an orthogonal non-oriented two-dimensional bin packing problem where items are associated with due-dates. Two objectives are considered: minimize (i) the number of bins and (ii) the maximum lateness of the items. We discuss basic properties of non-dominated solutions and propose a sequential value correction heuristic that outperforms two benchmark algorithms specifically designed for this problem. We also extend the benchmark dataset for this problem with new and larg...

Robust scheduling for minimizing maximum lateness on a serial-batch processing machine

We study a robust single-machine scheduling problem with uncertain processing times on a serial-batch processing machine to minimize maximum lateness. The problem can model many practical production and logistics applications which involve uncertain factors such as defect rates. A solution to a batch scheduling problem can be represented as a combination of a job-processing sequence and a partition of this sequence (batch sizing). To solve the problem, we prove that the job ordering rule for ...

Scopri

Accesso al fulltext

no fulltext8551
restricted17
reserved3

CINECA IRIS Institutional Research Information System