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…

2007

This work introduces the Bees Algorithm, a new optimisation algorithm inspired by the foraging behaviour of honey-bees. In its…

2007

We consider in this paper some programming competition problems (which are near to some problems of ACM competitions) of the…

2005

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

2002

High-level synthesis operates on internal models known as control/data flow graphs (CDFG) and produces a register-transfer-level…

2001

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

1999

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

1996

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

1975

Abstract : Theory and methods are presented for analyzing sensitivity of the optimal value and optimal solution set to…

1972