Publication:4719750
From MaRDI portal
zbMath1042.90002MaRDI QIDQ4719750
No author found.
Publication date: 5 January 2000
00B15: Collections of articles of miscellaneous specific interest
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
90-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming
Related Items
Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning, 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 method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems, The feedback arc set problem with triangle inequality is a vertex cover problem, 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem, An exact bit-parallel algorithm for the maximum clique problem, Communicability graph and community structures in complex networks, A note on the complexity of longest path problems related to graph coloring, Speeding up branch and bound algorithms for solving the maximum clique problem, On some domination colorings of graphs, Optimizing revenue in CDMA networks under demand uncertainty, Gap, cosum and product properties of the θ′ bound on the clique number
