Search
Search Results
-
A novel parallel combinatorial algorithm for multiparametric programming
Multiparametric programming and control has received a lot of attention in the past twenty years with significant advances reported in the open...
-
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source...
-
A parallel splitting ALM-based algorithm for separable convex programming
The augmented Lagrangian method (ALM) provides a benchmark for solving the canonical convex optimization problem with linear constraints. The direct...
-
Advanced Model of Parallel Sorting Algorithm with Ranking
The model of parallel sorting of a number array with ranking based on the simultaneous application of high-speed decrement/increment operations...
-
Exponential-time algorithms for parallel machine scheduling problems
In this paper we consider the problem of scheduling a set of jobs on unrelated parallel machines in the presence of job release dates and deadlines,...
-
Brain Principles Programming
AbstractThe monograph “Strong Artificial Intelligence. On the Approaches to Superintelligence,” referenced by this paper, provides a...
-
An Affine Scaling Algorithm for Biobjective Linear Programming
Given a biobjective linear programming problem, we develop an affine scaling algorithm with min-max direction and demonstrate its convergence for an...
-
MADAM : a parallel exact solver for max-cut based on semidefinite programming and ADMMWe present
MADAM , a parallel semidefinite-based exact solver for Max-Cut, a problem of finding the cut with the maximum weight in a given graph. The...
-
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
We design inexact proximal augmented Lagrangian based decomposition methods for convex composite programming problems with dual block-angular...
-
Generation of mathematical programming representations for discrete event simulation models of timed petri nets
This work proposes a mathematical programming (MP) representation of discrete event simulation of timed Petri nets (TPN). Currently, mathematical...
-
Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
Optimization problems with discrete–continuous decisions are traditionally modeled in algebraic form via (non)linear mixed-integer programming. A...
-
Interval constraint programming for globally solving catalog-based categorical optimization
In this article, we propose an interval constraint programming method for globally solving catalog-based categorical optimization problems. It...
-
Open issues and recent advances in DC programming and DCA
DC (difference of convex functions) programming and DC algorithm (DCA) are powerful tools for nonsmooth nonconvex optimization. This field was...
-
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
Scheduling drilling activities for oil and gas exploration involves solving a problem of optimal routing of a fleet of vehicles that represent...
-
Optimization of film-type optical fiber wiring design using mixed-integer programming problem
Optical fibers are among the most widely used tools in information communication today, and they have had an active development trajectory. Film...
-
Data-Driven Distributionally Robust Risk-Averse Two-Stage Stochastic Linear Programming over Wasserstein Ball
In this paper, we consider a data-driven distributionally robust two-stage stochastic linear optimization problem over 1-Wasserstein ball centered at...
-
Bi-objective multistage stochastic linear programming
We propose an algorithm for solving a class of bi-objective multistage stochastic linear programs. We show that the cost-to-go functions are saddle...
-
Dissipativity in Infinite Horizon Optimal Control and Dynamic Programming
In this paper we extend dynamic programming techniques to the study of discrete-time infinite horizon optimal control problems on compact control...
-
A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
Sentence compression is an important problem in natural language processing with wide applications in text summarization, search engine and human–AI...
-
OPTIMAL CONTROL OF AN SIR EPIDEMIC MODEL BASED ON DYNAMIC PROGRAMMING APPROACH
This paper investigates optimal control of a susceptible-infected-recovered (SIR) epidemic model using the dynamic programming approach. In fact, our...
