Discrete optimization

Known as: Discrete, Discrete optimisation

Discrete optimization is a branch of optimization in applied mathematics and computer science.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

We consider the problem of computing a minimum-weight Hamiltonian cycle on an undirected graph with edges' weights from set {0, 1…

2005

Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we…

2003

Modern meta-heuristic search strategies are often used to solve discrete optimisation problems with little regard to varying the…

2001

We consider the use of a fixed gain version of SPSA (simultaneous perturbation stochastic approximation) for optimizing a class…

2000

The optimisation of laminated composite structures is a highly nonlinear problem with both continuous and discrete design…

1999

The multicriteria problem of majority choice on a system of subsets of a finite set with linear partial criteria (MINSUM) is…

1998

1996

VP reconfiguration is a powerful and flexible tool to cope with traffic changes and/or equipment failures in ATM networks. In the…

1996

By using linear parametricization of criteria in multicriteria discrete programming, part of the Pareto optimal solutions can be…

1972