The following pages link to Panos M. Pardalos (Q167615):
Displaying 50 items.
- Information security decisions for two firms in a market with different types of customers (Q2279760) (← links)
- Less is more approach for competing groups scheduling with different learning effects (Q2292126) (← links)
- Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs (Q2292140) (← links)
- Dynamic search trajectory methods for global optimization (Q2294590) (← links)
- Model simplification for supervised classification of metabolic networks (Q2294595) (← links)
- Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production (Q2295326) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- Group testing with geometry of classical groups over finite fields (Q2313412) (← links)
- Loss function, unbiasedness, and optimality of Gaussian graphical model selection (Q2317292) (← links)
- A note on open problems and challenges in optimization theory and algorithms (Q2325240) (← links)
- Optimal location problems for electric vehicles charging stations: models and challenges (Q2325245) (← links)
- Massive datasets and machine learning for computational biomedicine: trends and challenges (Q2329887) (← links)
- An improvement on parametric \(\nu\)-support vector algorithm for classification (Q2329896) (← links)
- Data-dependent approximation in social computing (Q2337588) (← links)
- No free lunch theorem: a review (Q2337592) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Optimal-constrained multicast sub-graph over coded packet networks (Q2343995) (← links)
- Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
- The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
- Robust aspects of solutions in deterministic multiple objective linear programming (Q2355799) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- A decision making process application for the slurry production in ceramics via fuzzy cluster and data mining (Q2358864) (← links)
- D-optimal matrices via quadratic integer optimization (Q2359153) (← links)
- Real options approach to explore the effect of organizational change on IoT development project (Q2359407) (← links)
- Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines (Q2359408) (← links)
- Non-convex multi-objective optimization (Q2360302) (← links)
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity (Q2370036) (← links)
- A Python/C library for bound-constrained global optimization with continuous GRASP (Q2377221) (← links)
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem (Q2379818) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Operating room planning and surgical case scheduling: a review of literature (Q2424648) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- The wireless network jamming problem (Q2426656) (← links)
- Simple measure of similarity for the market graph construction (Q2438062) (← links)
- A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- On the optimization properties of the correntropic loss function in data analysis (Q2448161) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- Algorithms with high order convergence speed for blind source extraction (Q2457952) (← links)
- Global optimization by continuous grasp (Q2458920) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Local saddle point and a class of convexification methods for nonconvex optimization problems (Q2460140) (← links)
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
- Jamming communication networks under complete uncertainty (Q2465566) (← links)
- Total energy optimal multicasting in wireless ad hoc networks (Q2467570) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
