Results 81 to 90 of about 3,912 (195)
An MILP Model for Distributed Energy System Optimization
Chemical Engineering Transactions, 2013 Investigations regarding means to achieve savings in primary energy use and to decrease anthropogenic CO2 emissions have shown that improved energy efficiency has potential to offer a significant contribution to this cause. Considering energy networks and systems, improvements can be achieved by optimizing the structure of the energy chains and ...
Haikarainen Carl +2 more
openaire +2 more sources
Scheduling optimization of optical lens polishing
International Transactions in Operational Research, Volume 33, Issue 6, Page 3744-3768, November 2026.Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley +1 more source
EnergiesThis paper proposes a hybrid optimization framework that synergizes mixed-integer linear programming (MILP) and reinforcement learning (RL) to minimize operational costs and carbon emissions in multi-zonal data centers integrated with renewable ...
Abubakar Rafique +7 more
doaj +1 more source
A MILP for multi-machine injection moulding sequencing in the scope of C2NET Project
International Journal of Production Management and Engineering, 2018 The goal of C2NET European H2020 Funded Project is the creation of cloud-enabled tools for supporting the SMEs supply network optimization of manufacturing and logistic assets based on collaborative demand, production and delivery plans.
Beatriz Andrés +4 more
doaj +1 more source
MILP models of a patient transportation problem
Central European Journal of Operations ResearchAbstractWith ageing societies and increasing number of patients, there is a growing need for quality services that help transporting non-urgent patients to hospitals. In logistics, patient transportation problems are usually modeled as a dial-a-ride problem.
Martin Tóth +2 more
openaire +1 more source
On MILP Models for the OWA Optimization
Journal of Telecommunications and Information Technology, 2012 The problem of aggregating multiple outcomes to form overall objective functions is of considerable importance in many applications. The ordered weighted averaging (OWA) aggregation uses the weights assigned to the ordered values (i.e., to the largest value, the second largest and so on) rather than to the specific coordinates.
Włodzimierz Ogryczak, Paweł Olender
openaire +2 more sources
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
Energies, 2019 In this paper, the mixed integer linear programming (MILP) for solving unit commitment (UC) problems in a hybrid power system containing thermal, hydro, and wind power have been studied.
Bo Fu +4 more
doaj +1 more source
Learning optimal objective values for MILP
CoRRModern Mixed Integer Linear Programming (MILP) solvers use the Branch-and-Bound algorithm together with a plethora of auxiliary components that speed up the search. In recent years, there has been an explosive development in the use of machine learning for enhancing and supporting these algorithmic components. Within this line, we propose a methodology
Lara Scavuzzo +2 more
openaire +2 more sources
International Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source