Results 261 to 270 of about 52,409 (312)

Some problems in discrete optimization

Mathematical Programming, 1971
The present paper concentrates on several problems of network flows and discrete optimization. Progress has been made on some of the problems while little is known about others. Some of the problems discussed are shortest paths, multi-commodity flows, traveling salesman problems, m-center problem, telepak problems and binary trees.
openaire   +1 more source

Optimization Parallelizing for Discrete Programming Problems

Cybernetics and Systems Analysis, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergienko, I. V., Shilo, V. P., Roshchin, V. A.   +2 more
openaire   +2 more sources

Discretization of Optimal Control Problems

2011
Solutions to optimization problems with pde constraints inherit special properties; the associated state solves the pde which in the optimization problem takes the role of a equality constraint, and this state together with the associated control solves an optimization problem, i.e., together with multipliers satisfies first- and second-order necessary
Hinze, Michael, Rösch, Arnd
openaire   +1 more source

Discretized switching time optimization problems

2013 European Control Conference (ECC), 2013
A switched system is defined by a family of vector fields together with a switching law which chooses the active vector field at any time. Thus, the switching law encoding the switching times and the sequence of modes may serve as a design parameter. Switching time optimization (STO) focuses on the optimization of the switching times in order to govern
Kathrin Flaßkamp, Todd D. Murphey, Sina Ober-Blöbaum   +2 more
openaire   +1 more source

A Method for Solving Discrete Optimization Problems

Operations Research, 1966
This paper describes a simple, easily-programmed method for solving discrete optimization problems with monotone objective functions and completely arbitrary (possibly nonconvex) constraints. The method is essentially one of partial enumeration, and is closely related to the “lexicographic” algorithm of Gilmore and Gomory for the “knapsack” problem ...
Eugene L. Lawler, M. D. Bell
openaire   +1 more source

Optimal discretization of Ill-posed problems

Ukrainian Mathematical Journal, 2000
Summary: We present a review of results obtained in the Institute of Mathematics of National Ukrainian Academy of Sciences when investigating the optimal digitization of ill-posed problems.
Pereverzev, S. V., Solodkij, S. G.
openaire   +1 more source

A discrete method for the initialization of semi-discrete optimal transport problem

Knowledge-Based Systems, 2021
Abstract Semi-discrete optimal transport setting is a very important formulation in the computation of Wasserstein distance, as it is an approximation form of the continuous setting of optimal transport. However, initialization process of dual weight vector for the dual problem in this setting is required for the computation of the first and second ...
Judy Yangjun Lin, Shaoyan Guo, Longhan Xie, Ruxu Du, Gu Xu   +4 more
openaire   +1 more source

Optimality Conditions for Discrete-Time Control Problems

Journal of Optimization Theory and Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marko Antonio Rojas-Medar, Camila Isoton, Lucelina Batista dos Santos, Violeta Vivanco-Orellana   +3 more
openaire   +1 more source

Optimal Stopping in a Discrete Search Problem

Operations Research, 1973
In a search among m locations for an object possibly hidden in one, we are given prior probabilities of location pi, searching costs ci, and overlook probabilities αi. It is known also that an “unsearchable” location contains the object with prior probability p0, and, in addition, a penalty cost C is charged if the search is terminated unsuccessfully.
openaire   +2 more sources

Parallel Search Algorithms for Discrete Optimization Problems

ORSA Journal on Computing, 1994
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is formulated in terms of finding a (minimum cost) solution path in a graph from an initial node to a goal node and solved by graph/tree search methods ...
Ananth Grama, Vipin Kumar 0001
openaire   +2 more sources