scientific article

No author found.

Publication date: 29 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematical programming (90Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Operations research and management science (90Bxx)

Related Items

Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems, POPMUSIC as a matheuristic for the berth allocation problem, A population heuristic for constrained two-dimensional non-guillotine cutting, An online optimization-based procedure for the assignment of airplane seats, Enhancing quantum efficiency of thin-film silicon solar cells by Pareto optimality, Scheduling with few changes, A convergent decomposition method for box-constrained optimization problems, CFD-based optimization of fuel injection strategies in a diesel engine using an adaptive gradient method, Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios, Classification of applied methods of combinatorial optimization, Joint optimal determination of process mean, production quantity, pricing, and market segmentation with demand leakage, Global optimization using \(q\)-gradients, Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems, Inventory routing with continuous moves, A nonmonotone GRASP, A bundle modification strategy for convex minimization, Loss of customer goodwill in the uncapacitated lot-sizing problem, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering, A new variant of the memory gradient method for unconstrained optimization, Worst-case analysis of maximal dual feasible functions, 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, Simultaneous estimation of thin film thickness and optical properties using two-stage optimization, Registrar: a complete-memory operator to enhance performance of genetic algorithms, Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks, Scheduling jobs with truncated exponential learning functions, A \(k\), \(k-\epsilon\) optimality selection based multi objective genetic algorithm with applications to vehicle engineering, Distributed stochastic subgradient projection algorithms for convex optimization, Scheduling arc maintenance jobs in a network to maximize total flow over time, An incremental primal-dual method for nonlinear programming with special structure, A guided reactive GRASP for the capacitated multi-source Weber problem, A branch-and-cut algorithm for factory crane scheduling problem, A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints, On zero duality gap in nonconvex quadratic programming problems, Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies, Radar placement along banks of river, The block diagram method for designing the particle swarm optimization algorithm, Finding the shortest paths by node combination, Switching stepsize strategies for sequential quadratic programming, Higher order numerical differentiation on the infinity computer, Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints, GRASP for set packing problems., Behavior of DCA sequences for solving the trust-region subproblem, Discrete time dynamic traffic assignment models and solution algorithm for managed lanes, An improved training algorithm for feedforward neural network learning based on terminal attractors, Constructing composite search directions with parameters in quadratic interpolation models, Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, Low dimensional simplex evolution: a new heuristic for global optimization, Low order-value approach for solving var-constrained optimization problems, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, A class of linearized proximal alternating direction methods, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Research on dual-stator winding multi-phase high-speed induction generator with rectifier load, Relational linear programming, A global optimization heuristic for estimating agent based models, Design of hybrids for the minimum sum-of-squares clustering problem, The undirected capacitated general routing problem with profits, Single-machine scheduling with nonlinear deterioration, Complexity analysis and optimization of the shortest path tour problem, Identifying algorithmic vulnerabilities through simulated annealing, A relaxation method for solving systems with infinitely many linear inequalities, A multi-product continuous review inventory system in stochastic environment with budget constraint, Generalized principal pivot transforms, complementarity theory and their applications in stochastic games, Strong convergence of a proximal point algorithm with general errors, Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems, Conjugate gradient methods using value of objective function for unconstrained optimization, Optimization by ant algorithms: possible roles for an individual ant, A new supermemory gradient method for unconstrained optimization problems, A time-based pheromone approach for the ant system, Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Capacity optimization through sensing threshold adaptation for cognitive radio networks, On the optimality of list scheduling for online uniform machines scheduling, Clonal selection: an immunological algorithm for global optimization over continuous spaces, A practical method for solving large-scale TRS, On global unconstrained minimization of the difference of polyhedral functions, Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis, The sagitta method for solving linear programs, Speeding up continuous GRASP, Solving the vehicle routing problem with adaptive memory programming methodology, On optimization algorithms for the reservoir oil well placement problem, Parallel and distributed local search in COMET, Analysis of new variable selection methods for discriminant analysis, An evolutionary heuristic for the index tracking problem., An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances, Aggregation error for location models: Survey and analysis, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Improving Benders decomposition using a genetic algorithm, Multi-reservoir production optimization, A variable selection method based on Tabu search for logistic regression models, A meta-heuristic approach for solving the urban network design problem, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, On the equivalence of linear complementarity problems, On the solution of min-sum-min problems, Scatter search and bionomic algorithms for the aircraft landing problem, A multi-parent genetic algorithm for the quadratic assignment problem, An optimization approach for ambulance location and the districting of the response segments on highways, A memetic algorithm with dynamic population management for an integrated production-distribution problem, An efficient framework for optimal robust stochastic system design using stochastic simulation, An efficient GRASP algorithm for disassembly sequence planning, Prospect theory–based portfolio optimization: an empirical study and analysis using intelligent algorithms, Prim-based support-graph preconditioners for min-cost flow problems, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study, A Deterministic Algorithm for Global Optimization, Exactness and algorithm of an objective penalty function, Computing Teichmüller maps between polygons, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem, Unnamed Item, Biologically inspired parent selection in genetic algorithms, Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem, Metaheuristics: A Canadian Perspective, A new method for ranking non-extreme efficient units in data envelopment analysis, Efficient model for interval goal programming with arbitrary penalty function, Levitin-Polyak well-posedness by perturbations of inverse variational inequalities, A global optimization point of view to handle non-standard object packing problems, On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds, A new hybrid stochastic approximation algorithm, Improving differential evolution through a unified approach, Directional differentiability, coexhausters, codifferentials and polyhedral DC functions, A decision tool for optimal irrigated crop planning and water resources sustainability, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, New heuristics for total tardiness minimization in a flexible flowshop, A deterministic approach to global box-constrained optimization, Heuristics for urban road network design: lane layout and signal settings, On Bilevel Optimization with Inexact Follower, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Converging marriage in honey-bees optimization and application to stochastic dynamic programming, Global optimization by continuous grasp, Repairing MIP infeasibility through local branching, Nonlinear optimization with GAMS /LGO, A feasibility pump heuristic for general mixed-integer problems, Global Optimization in Practice:State of the Art and Perspectives, Controller tuning approach with robustness, stability and dynamic criteria for the original AVR system, Emergency response in natural disaster management: allocation and scheduling of rescue units, A scatter search approach for the minimum sum-of-squares clustering problem, Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures, Randomized heuristics for the Max-Cut problem, Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization, A computational tool for optimizing the urban public transport: A real application, Manpower allocation with time windows and job-teaming constraints, Heuristic algorithms for the cardinality constrained efficient frontier, A smoothing heuristic for a bilevel pricing problem, A Convex Model for the Optimization of Distribution Systems with Distributed Generation, Coordination of production and transportation in supply chain scheduling, Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere, An objective penalty function method for biconvex programming, Optimal exact designs of experiments via mixed integer nonlinear programming, Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems, On Job Scheduling with Preemption Penalties, Global Optimization Toolbox for Maple: an introduction with illustrative applications, A self-adaptive biogeography-based algorithm to solve the set covering problem, An improvement on parametric \(\nu\)-support vector algorithm for classification, Fast modulus-based matrix splitting iteration methods for implicit complementarity problems, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, Scatter search --- wellsprings and challenges, A path relinking approach with ejection chains for the generalized assignment problem, Scatter search for the vehicle routing problem with time windows, Tabu search directed by direct search methods for nonlinear global optimization, The capacitated centred clustering problem, Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization