The following pages link to Panos M. Pardalos (Q167615):
Displaying 50 items.
- (Q163628) (redirect page) (← links)
- On multivariate network analysis of statistical data sets with different measures of association (Q276528) (← links)
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types (Q276548) (← links)
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan (Q319276) (← links)
- A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
- Information theory perspective on network robustness (Q341919) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- Iterative roots of multidimensional operators and applications to dynamical systems (Q395835) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A modified power spectral density test applied to weighing matrices with small weight (Q411261) (← links)
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
- Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- Exact model for the cell formation problem (Q479245) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- Pareto-optimal front of cell formation problem in group technology (Q486727) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
- Cell formation in industrial engineering. Theory, algorithms and experiments (Q498514) (← links)
- Uniformly most powerful unbiased test for conditional independence in Gaussian graphical model (Q504465) (← links)
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
- A diverse human learning optimization algorithm (Q506463) (← links)
- A modified active set algorithm for transportation discrete network design bi-level problem (Q506465) (← links)
- An equivalent transformation of multi-objective optimization problems (Q513605) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times (Q513627) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- On positive-influence target-domination (Q526426) (← links)
- A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
- Generalized Nash equilibrium problems for lower semi-continuous strategy maps (Q539507) (← links)
- A hybrid particle swarm optimization and tabu search algorithm for order planning problems of steel factories based on the make-to-stock and make-to-order management architecture (Q542568) (← links)
- Robust multi-sensor scheduling for multi-site surveillance (Q543509) (← links)
- Mathematical aspects of network routing optimization. (Q549117) (← links)
- (Q591448) (redirect page) (← links)
- Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem (Q598590) (← links)
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
- Periodic complementary binary sequences and combinatorial optimization algorithms (Q604877) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
