The following pages link to (Q4719750):
Displaying 13 items.
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems (Q266014) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Communicability graph and community structures in complex networks (Q833142) (← links)
- A note on the complexity of longest path problems related to graph coloring (Q1433224) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Optimizing revenue in CDMA networks under demand uncertainty (Q2462173) (← links)
- Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)
- Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning (Q5036804) (← links)
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
- A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
