scientific article; zbMATH DE number 846225
From MaRDI portal
Publication:4864690
zbMath0872.90002MaRDI QIDQ4864690
No author found.
Publication date: 20 February 1996
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) Complexity and performance of numerical algorithms (65Y20)
Related Items
An algorithm for solving general D. C. programming problems, A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm, A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times, Scheduling jobs with truncated exponential learning functions, Approximation algorithm for a class of global optimization problems, Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem, NP-hardness of deciding convexity of quartic polynomials and related problems, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, Approximation algorithms for multiple terminal, Hamiltonian path problems, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Goal and predictive coordination in two level hierarchical systems, Unnamed Item, Calibration in Survey Sampling as an Optimization Problem
