The following pages link to Adnan Yassine (Q306398):
Displaying 23 items.
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- A feasible primal-dual interior point method for linear semidefinite programming (Q329782) (← links)
- DCA for solving the scheduling of lifting vehicle in an automated port container terminal (Q373199) (← links)
- The quasi-Newton method and the infinite matrix theory applied to the continued fractions (Q426230) (← links)
- New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
- Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations (Q628733) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- Matrix transformations and quasi-Newton methods (Q925427) (← links)
- A new efficient short-step projective interior point method for linear programming (Q2417152) (← links)
- A hybrid ant colony and simulated annealing algorithm to solve the container stacking problem at seaport terminal (Q2627642) (← links)
- Non-smooth singular Newton's method for positive semidefinite solution of nonlinear matrix equations (Q2627766) (← links)
- (Q2787250) (← links)
- Hybrid Genetic Simulated Annealing Algorithm (HGSAA) to Solve Storage Container Problem in Port (Q2919397) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- (Q3105399) (← links)
- (Q3400439) (← links)
- Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm (Q5003514) (← links)
- An efficient simplification method for point cloud based on salient regions detection (Q5242353) (← links)
- Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984) (← links)
- Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
- An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model (Q6065602) (← links)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
