The following pages link to (Q2753185):
Displaying 50 items.
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems (Q266014) (← links)
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- Scheduling with few changes (Q299829) (← links)
- Joint optimal determination of process mean, production quantity, pricing, and market segmentation with demand leakage (Q320933) (← links)
- Global optimization using \(q\)-gradients (Q322763) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Scheduling jobs with truncated exponential learning functions (Q395856) (← links)
- A \(k\), \(k-\epsilon\) optimality selection based multi objective genetic algorithm with applications to vehicle engineering (Q402210) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Radar placement along banks of river (Q427395) (← links)
- The block diagram method for designing the particle swarm optimization algorithm (Q427406) (← links)
- Behavior of DCA sequences for solving the trust-region subproblem (Q454269) (← links)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems (Q481353) (← links)
- Relational linear programming (Q511779) (← links)
- A practical method for solving large-scale TRS (Q537634) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering (Q609568) (← links)
- Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- Higher order numerical differentiation on the infinity computer (Q644507) (← links)
- Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints (Q644522) (← links)
- Discrete time dynamic traffic assignment models and solution algorithm for managed lanes (Q652653) (← links)
- An improved training algorithm for feedforward neural network learning based on terminal attractors (Q652671) (← links)
- Constructing composite search directions with parameters in quadratic interpolation models (Q652677) (← links)
- Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
- Low order-value approach for solving var-constrained optimization problems (Q656968) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- Identifying algorithmic vulnerabilities through simulated annealing (Q691443) (← links)
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- A multi-product continuous review inventory system in stochastic environment with budget constraint (Q691465) (← links)
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games (Q691469) (← links)
- Strong convergence of a proximal point algorithm with general errors (Q691475) (← links)
- Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems (Q691490) (← links)
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint (Q693140) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Capacity optimization through sensing threshold adaptation for cognitive radio networks (Q694188) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Clonal selection: an immunological algorithm for global optimization over continuous spaces (Q695337) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- On optimization algorithms for the reservoir oil well placement problem (Q710645) (← links)
