scientific article; zbMATH DE number 544186
From MaRDI portal
Publication:4286721
zbMath0786.90067MaRDI QIDQ4286721
Toshihide Ibaraki, Naoki Katoh
Publication date: 4 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Resource allocation with lumpy demand: To speed or not to speed?, Cardinality constrained path covering problems in grid graphs, Maximum likelihood estimation of cell probabilities in constrained multinomial models, DYNAMIC OPTIMAL BUDGET ALLOCATION FOR INTEGRATED MARKETING CONSIDERING PERSISTENCE, Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation, Detection of a Markovian target with optimization of the search efforts under generalized linear constraints, A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints, Constructing the minimization diagram of a two-parameter problem, On a nonseparable convex maximization problem with continuous Knapsack constraints, Roll cutting in the curtain industry, or: a well-solvable allocation problem, Outsourcing warranty repairs: Dynamic allocation, Ameso optimization: a relaxation of discrete midpoint convexity, M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System, A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints, On a Reduction for a Class of Resource Allocation Problems, A fast algorithm for quadratic resource allocation problems with nested constraints, Scaling, proximity, and optimization of integrally convex functions, General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems, Minimum variance allocation among constrained intervals, Discrete Midpoint Convexity, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, Fairness over time in dynamic resource allocation with an application in healthcare, Optimal periodic resource allocation in reactive dynamical systems: Application to microalgal production, Colorful graph coloring, Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids, A heuristic algorithm for a chance constrained stochastic program, Dynamic routing of prioritized warranty repairs, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, Interval scheduling: A survey, r-extreme signalling for congestion control, Minimization of quasi-convex symmetric and of discretely quasi-convex symmetric functions, A survey on the continuous nonlinear resource allocation problem, Optimum component test plans for phased-mission systems, A new branch-and-bound algorithm for standard quadratic programming problems, From the theory to the tools: parallel dynamic programming, A hierarchical optimization model of resource allocation, Complexity and algorithms for nonlinear optimization problems, On closed-form solutions of a resource allocation problem in parallel funding of R\& D projects, Online surrogate problem methodology for stochastic discrete resource allocation problem., Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique, Ant colony optimization for the nonlinear resource allocation problem, Stability analysis of network-based cooperative resource allocation strategies, Optimization in production quota problem with convex cost function, A pegging algorithm for the nonlinear resource allocation problem, Signalling and obfuscation for congestion control, Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments, Upper and lower bounding procedures for the multiple knapsack assignment problem, A Stackelberg equilibrium for a missile procurement problem, A Decomposition Algorithm for Nested Resource Allocation Problems, A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks, Minimax resource allocation problems with ordering constraints, A convex programming with nested constraints on the amount of resources, Efficient algorithms for robustness in resource allocation and scheduling problems, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, A decentralized heuristic approach towards resource allocation in femtocell networks, A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation, The interface of buffer design and cyclic scheduling decisions in deterministic flow lines, A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems, Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems, Polynomial time approximation schemes for class-constrained packing problems, Decision model and analysis for investment interest expense deduction and allocation, Finite method for a nonlinear allocation problem, The complexity of resource allocation and price mechanisms under bounded rationality, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Decentral allocation planning in multi-stage customer hierarchies, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Distributed resource allocation over random networks based on stochastic approximation, Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions, An ASIP model with general gate opening intervals, A biobjective method for sample allocation in stratified sampling, A nonlinear knapsack problem, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems, An inspection game with multiple inspectees, A particle swarm optimization approach to the nonlinear resource allocation problem, Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling, A short proof of optimality of the bottom up algorithm for discrete resource allocation problems, Multi-period resource allocation for estimating project costs in competitive bidding, Quadratic resource allocation with generalized upper bounds, Sparse solutions to random standard quadratic optimization problems, Multiperiod allocation of substitutable resources, Robust recoverable and two-stage selection problems, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, On recoverable and two-stage robust selection problems with budgeted uncertainty, Proportional and maxmin fairness for the sensor location problem with chance constraints, Algorithms for the item assortment problem: an application to vending machine products, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Fairness criteria for allocating scarce resources, A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem, Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management., Resource planning and allocation problem under uncertain environment, Optimal response against bioterror attack on airport terminal, Minmax regret linear resource allocation problems., Mission-based component testing for series systems, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., Relocation problems arising in conservation biology, Dual semidefinite programs without duality gaps for a class of convex minimax programs, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, On sparsity of the solution to a random quadratic optimization problem, A nonlinear minimax allocation problem with multiple knapsack constraints, An algorithm for the fair resource allocation problem with a submodular constraint, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, Approximation based fuzzy multi-objective models with expected objectives and chance constraints: application to earth-rock work allocation, Using quadratic programming to solve high multiplicity scheduling problems on parallel machines, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Distributed algorithm design for optimal resource allocation problems via incremental passivity theory, Nonconvex piecewise linear knapsack problems, Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma, Continuous relaxation for discrete DC programming, A lexicographic minimax algorithm for multiperiod resource allocation, Minimax resource allocation problems: Optimization and parametric analysis, Linear time algorithms for some separable quadratic programming problems, The design of optimum component test plans for system reliability, On the robustness of mixture index of fit, An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths, Generalized surrogate problem methodology for online stochastic discrete optimization, Algorithms for storage allocation based on client preferences, A randomized algorithm for the min-Max selecting items problem with uncertain weights, Heuristic algorithms for the general nonlinear separable knapsack problem, On the solution of concave knapsack problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, On speed scaling via integer programming, Selecting the nozzle assortment for a gantry-type placement machine, Dynamic resource allocation in fuzzy coalitions: a game theoretic model, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Approximation schemes for \(r\)-weighted minimization knapsack problems, Boltzmann distributed replicator dynamics: population games in a microgrid context, Min-max optimization of several classical discrete optimization problems, LP relaxation of the two dimensional knapsack problem with box and GUB constraints, Identifying Pareto-optimal settlements for two-party resource allocation negotiations, Project selection with discounted returns and multiple constraints, Some methods for evaluating the optimality of elements in matroids with ill-known weights, Inverse optimization for linearly constrained convex separable programming problems, Effect of modeling uncertainty on some routing problems, Extension of M-convexity and L-convexity to polyhedral convex functions, Polyhedral structure of submodular and posi-modular systems, On G-network and resource allocation in multimedia systems, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, Solving the unit commitment problem by a unit decommitment method, Fair optimization and networks: a survey, A study on sequential minimal optimization methods for standard quadratic problems, Generating the best \(K\) sequences in relocation problems, The nonlinear knapsack problem - algorithms and applications, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, Optimization of static traffic allocation policies, Nonlinear integer programming for optimal allocation in stratified sampling, The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking, Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization, Dynamic pricing and the direct-to-customer model in the automotive industry
