Pages that link to "Item:Q185429"

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

Displaying 50 items.

• On the mod sum number of \(H _{m,n }\) (Q385472) (← links)
• Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
• Applications of extension grey prediction model for power system forecasting (Q385475) (← links)
• Minimum degree, edge-connectivity and radius (Q385477) (← links)
• Online LPT algorithms for parallel machines scheduling with a single server (Q385479) (← links)
• A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
• Single machine scheduling problems with subcontracting options (Q385484) (← links)
• Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
• Roman domination on strongly chordal graphs (Q385486) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
• Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
• Relay node placement in two-tiered wireless sensor networks with base stations (Q385493) (← links)
• Semi-online scheduling for jobs with release times (Q385494) (← links)
• Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
• A note on anti-coordination and social interactions (Q386417) (← links)
• The density maximization problem in graphs (Q386420) (← links)
• Property testing for cyclic groups and beyond (Q386421) (← links)
• Optimal strategies for the one-round discrete Voronoi game on a line (Q386423) (← links)
• Finding paths with minimum shared edges (Q386426) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Unavoidable regularities in long words with bounded number of symbol occurrences (Q386431) (← links)
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
• (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• Flipping triangles and rectangles (Q386439) (← links)
• Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
• The topology aware file distribution problem (Q386444) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• Recognition of overlap graphs (Q405660) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Characteristics of the maximal independent set ZDD (Q405673) (← links)
• A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• Staying safe and visible via message sharing in online social networks (Q405681) (← links)
• Value-at-risk support vector machine: stability to outliers (Q405683) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
• Optimal tree structure with loyal users and batch updates (Q411208) (← links)
• Resource-sharing systems and hypergraph colorings (Q411210) (← links)
• The maximum box problem for moving points in the plane (Q411213) (← links)
• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling (Q411217) (← links)
• Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
• A generalization of Macula's disjunct matrices (Q411221) (← links)