scientific article; zbMATH DE number 1384868
From MaRDI portal
Publication:4719750
zbMath1042.90002MaRDI QIDQ4719750
No author found.
Publication date: 5 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items (13)
A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems ⋮ Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning ⋮ Communicability graph and community structures in complex networks ⋮ On some domination colorings of graphs ⋮ Online \(L(2,1)\)-coloring problem on paths with restricted size of memory ⋮ A recombination‐based matheuristic for mixed integer programming problems with binary variables ⋮ A note on the complexity of longest path problems related to graph coloring ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Optimizing revenue in CDMA networks under demand uncertainty ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem ⋮ An exact bit-parallel algorithm for the maximum clique problem ⋮ Gap, cosum and product properties of the θ′ bound on the clique number
This page was built for publication:
