The following pages link to (Q4198056):
Displayed 50 items.
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
- Multiprocessor scheduling by generalized extremal optimization (Q600839) (← links)
- Multicriteria, multi-user scheduling in grids with advance reservation (Q600840) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- A polyhedral study of triplet formulation for single row facility layout problem (Q602769) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Combinatorial vector fields and the valley structure of fitness landscapes (Q604558) (← links)
- Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
- Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- On the unimodality of independence polynomials of some graphs (Q607359) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- Binding numbers and connected factors (Q607686) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity (Q608277) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- Optimal rectangle packing (Q610984) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Ockham efficiency theorem for stochastic empirical methods (Q613037) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse (Q613357) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- A stochastic programming model for scheduling call centers with global service level agreements (Q613494) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- A hybrid search method for the vehicle routing problem with time windows (Q613770) (← links)
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- How \(*\)not\(*\) to solve a sudoku (Q614048) (← links)
- A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow (Q614060) (← links)
- Influence of assortativity and degree-preserving rewiring on the spectra of networks (Q614567) (← links)
- Evolutionary design of oscillatory genetic networks (Q614630) (← links)
- The critical independence number and an independence decomposition (Q616388) (← links)
- Flexible-attribute problems (Q616800) (← links)
- Equivariant unification (Q616849) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)