The following pages link to Panos M. Pardalos (Q167615):
Displaying 50 items.
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity (Q2468342) (← links)
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
- Second-order cone and semidefinite representations of material failure criteria (Q2471099) (← links)
- Optimization in control and learning in coupled map lattice systems (Q2471116) (← links)
- A bilinear algorithm for sparse representations (Q2475611) (← links)
- Biclustering in data mining (Q2475854) (← links)
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
- Localization of minimax points (Q2481114) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- Generalized convexities and generalized gradients based on algebraic operations (Q2496689) (← links)
- Mining market data: a network approach (Q2499151) (← links)
- Cross-facility management of production and transportation planning problem (Q2499157) (← links)
- Optimization approach to the estimation and control of Lyapunov exponents (Q2499369) (← links)
- A combinatorial algorithm for message scheduling on controller area networks (Q2505322) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Coordination of production and transportation in supply chain scheduling (Q2514664) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Identifying and determining crowdsourcing service strategies: an empirical study on a crowdsourcing platform in China (Q2673395) (← links)
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← links)
- Distributionally robust joint chance-constrained support vector machines (Q2688915) (← links)
- Deep learning-based recommendation method for top-\(K\) tasks in software crowdsourcing systems (Q2698575) (← links)
- Optimization in the space of distribution functions and applications in the Bayes analysis (Q2724694) (← links)
- Complexity issues in nonconvex network flow problems (Q2743965) (← links)
- Algorithms for the least distance problem (Q2743973) (← links)
- (Q2751323) (← links)
- Optimal estimation of signal parameters using bilinear observations (Q2776671) (← links)
- A Method for Creating Private and Anonymous Digital Territories Using Attribute-Based Credential Technologies (Q2790441) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Tikhonov regularization for infeasible absolute value equations (Q2817229) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (Q2820105) (← links)
- Heuristic Algorithm for the Cell Formation Problem (Q2820107) (← links)
- Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← links)
- Kernel Principal Component Analysis: Applications, Implementation and Comparison (Q2820113) (← links)
- GRASP with Path-Relinking for Facility Layout (Q2820115) (← links)
- Comparative Analysis of the BRIC Countries Stock Markets Using Network Approach (Q2820118) (← links)
- Numerical methods and optimization. An introduction (Q2836474) (← links)
- Optimization Approaches for Solving String Selection Problems (Q2851340) (← links)
- Optimal solutions for the closest-string problem via integer programming (Q2890443) (← links)
- GRASP with path relinking for three-index assignment (Q2890469) (← links)
- Data Correcting Approaches in Combinatorial Optimization (Q2910841) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Feature selection based on meta-heuristics for biomedicine (Q2926050) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
