Pages that link to "Item:Q185429"
From MaRDI portal
The following pages link to Journal of Combinatorial Optimization (Q185429):
Displaying 50 items.
- On Barnette's conjecture and the \(H^{+-}\) property (Q266009) (← links)
- Some extremal properties of the multiplicatively weighted Harary index of a graph (Q266010) (← links)
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems (Q266014) (← links)
- Bounded information dissemination in multi-channel wireless networks (Q266016) (← links)
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Optimal weight allocation in rooted trees (Q266022) (← links)
- Extended cuts (Q266025) (← links)
- A modified firefly algorithm based on light intensity difference (Q266029) (← links)
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- Disjunctive total domination in graphs (Q266033) (← links)
- Implicit cover inequalities (Q266036) (← links)
- A solution to an open problem on lower against number in graphs (Q266038) (← links)
- On the efficiency index of a graph (Q266040) (← links)
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- On revenue maximization with sharp multi-unit demands (Q266046) (← links)
- Improving robustness of next-hop routing (Q266050) (← links)
- The entire choosability of plane graphs (Q266053) (← links)
- A reinforcement-learning approach for admission control in distributed network service systems (Q266057) (← links)
- Linearizable special cases of the QAP (Q266060) (← links)
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Chromatic kernel and its applications (Q266072) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Problem dependent optimization (PDO) (Q266075) (← links)
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree (Q266078) (← links)
- An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Optimization techniques for robust multivariate location and scatter estimation (Q281780) (← links)
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- Sizes and transmissions of digraphs with a given clique number (Q281810) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- On the directed cut cone and polytope (Q281821) (← links)
- Construction of optimal constant-dimension subspace codes (Q281823) (← links)
- Budget-constrained minimum cost flows (Q281825) (← links)
- Pseudo-automatic beam orientations in multi-criteria intensity-modulated radiation therapy (Q281827) (← links)
