Now showing items 1-10 of 412
MULTI-LEVEL INTEGER PROGRAMMING PROBLEM WITH MULTIPLE OBJECTIVES AT EACH LEVELPROGRAMACIÓN ENTERA MULTINIVEL PROBLEMA CON MÚLTIPLES OBJETIVOS EN CADA NIVEL
(Departamento de Matemática Aplicada. Facultad de Matemática y Computación. Universidad de La Habana, 2023)
Compressive Sensing for Inverse Scattering
Compressive sensing is a new field in signal processing and applied mathematics. It allows one to simultaneously sample and compress signals which are known to have a sparse representation in a known basis or dictionary ...
Solving the assignment of customers to trucks and visit days in a periodic routing real-world case1
(Pontificia Universidad Javeriana, 2018-01-01)
Introduction: This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP ...
Analysis of a generalized Linear Ordering Problem via integer programming
(Elsevier Science, 2019-12)
We study a generalized version of the linear ordering problem: Given a collection of partial orders represented by directed trees with unique root and height one, where each tree is associated with a nonnegative reward, ...
Mixed-integer linear programming approach for product design for life-cycle profit
(Pergamon-Elsevier Science Ltd, 2019-11)
The paper deals with the product design problem where the characteristics of new and remanufactured products must be determined. The objective of the problem is to maximize the total profit taking into account the design ...
Effects of binary variables in mixed integer linear programming based unit commitment in large-scale electricity markets
(Elsevier Science SA, 2018-07)
Mixed integer linear programming is one of the main approaches used to solve unit commitment problems. Due to the computational complexity of unit commitment problems, several researches remark the benefits of using less ...
An inverse problem resolution via piecewise linear underestimationResolución de un problema inverso vía subestimación lineal a trozos
(Universidad Centroccidental Lisandro Alvarado, 2012)
A note on primal-dual stability in infinite linear programming
(Springer Heidelberg, 2020-02)
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) of linear programming problems posed in infinite dimensional Banach spaces, and their corresponding dual problems, under ...
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem
We study the capacitated m-ring-star problem (CmRSP) that faces the design of minimum cost network structure that connects customers with m rings using a set of ring connections that share a distinguished node (depot), and ...