The following pages link to (Q4739657):
Displayed 50 items.
- Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
- Neural approach for solving several types of optimization problems (Q857585) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic (Q867921) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- On ascending Vickrey auctions for heterogeneous objects (Q869853) (← links)
- Ascending price Vickrey auctions for general valuations (Q869869) (← links)
- A microfluidic systems-based DNA algorithm for solving special 0-1 integer programming problem (Q872384) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- A spectral-multiplicity-tolerant approach to robust graph matching (Q888578) (← links)
- Lagrangian bounds from decision diagrams (Q890004) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- On the power of neural networks for solving hard problems (Q909457) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- The complexity of determinacy problem on group testing (Q913514) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- A feasibly constructive lower bound for resolution proofs (Q915457) (← links)
- k-sum optimization problems (Q916568) (← links)
- The optimum execution order of queries in linear storage (Q917278) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- A geometric consistency theorem for a symbolic perturbation scheme (Q918201) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Low-viscosity lattice gases (Q922154) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- A general trimming approach to robust cluster analysis (Q930658) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- Forming partnerships in a virtual factory (Q940918) (← links)
- The Monge-Ampère-Kantorovich approach to reconstruction in cosmology (Q942800) (← links)
- The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Additivity obstructions for integral matrices and pyramids (Q952468) (← links)
- A method for approximating pairwise comparison matrices by consistent matrices (Q956601) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Polynomial ring automorphisms, rational \((w,\sigma )\)-canonical forms, and the assignment problem (Q972847) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Correlation based networks of equity returns sampled at different time horizons (Q978862) (← links)
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- A novel iterative shape from focus algorithm based on combinatorial optimization (Q991937) (← links)