scientific article; zbMATH DE number 1302182
From MaRDI portal
Publication:4247449
zbMath0946.90066MaRDI QIDQ4247449
Toshihide Ibaraki, Naoki Katoh
Publication date: 10 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A flexible model for tree-structured multi-commodity markets, A two-resource allocation algorithm with an application to large-scale zero-sum defensive games, Relaxations and heuristics for the multiple non-linear separable knapsack problem, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance, Inverse scheduling: Two-machine flow-shop problem, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., Continuity and monotonicity of solutions to a greedy maximization problem, Comparative error bound theory for three location models: continuous demand versus discrete demand, A survey on the continuous nonlinear resource allocation problem, On the multicriteria allocation problem, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Inverse scheduling with maximum lateness objective, Extension of M-convexity and L-convexity to polyhedral convex functions, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, Fair optimization and networks: a survey, Allocating multiple defensive resources in a zero-sum game setting, The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
