Pages that link to "Item:Q185429"

The following pages link to Journal of Combinatorial Optimization (Q185429):

Displaying 50 items.

• Introduction: Special issue dedicated to the memory of Professor Wenqi Huang (Q306070) (← links)
• Optimal space coverage with white convex polygons (Q306074) (← links)
• Euclidean movement minimization (Q306076) (← links)
• Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
• Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
• Multi-neighborhood based path relinking for two-sided assembly line balancing problem (Q306088) (← links)
• A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• Tabu search for the real-world carpooling problem (Q306096) (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain (Q306101) (← links)
• An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
• An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
• Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) (Q306109) (← links)
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
• An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
• Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
• Solving constrained optimization problems by solution-based decomposition search (Q326460) (← links)
• Robustness of power-law networks: its assessment and optimization (Q326464) (← links)
• On strongly planar not-all-equal 3SAT (Q326466) (← links)
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
• The extremal spectral radii of \(k\)-uniform supertrees (Q326472) (← links)
• A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
• First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Characterisation of forests with trivial game domination numbers (Q326480) (← links)
• A minimized-rule based approach for improving data currency (Q326482) (← links)
• The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
• Signed total Roman domination in graphs (Q326484) (← links)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
• A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
• Maximum size of digraphs with some parameters (Q326498) (← links)
• Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
• A diagnosis algorithm by using graph-coloring under the PMC model (Q326504) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• Special issue for FAW 2014 (Q328680) (← links)
• Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
• Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
• Kernelization and randomized parameterized algorithms for co-path set problem (Q328686) (← links)
• Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
• Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)