The following pages link to (Q4739657):
Displayed 50 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies (Q139209) (← links)
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras (Q269278) (← links)
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- Weighted digraphs and tropical cones (Q273146) (← links)
- Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex (Q274455) (← links)
- Repairing high school timetables with polymorphic ejection chains (Q284402) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Minimum distance index for complex valued ICA (Q312095) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A rescheduling and cost allocation mechanism for delayed arrivals (Q342157) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Interpretable clustering using unsupervised binary trees (Q354178) (← links)
- The capacity expansion path problem in networks (Q364264) (← links)
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming (Q374676) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200) (← links)
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis (Q418747) (← links)
- Stochastic global optimization as a filtering problem (Q423021) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- The design and implementation of an interactive course-timetabling system (Q475210) (← links)
- Minimum energy control and optimal-satisfactory control of Boolean control network (Q482987) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- Computational complexity of convoy movement planning problems (Q494695) (← links)
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities (Q497936) (← links)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Nash equilibria in the two-player kidney exchange game (Q507331) (← links)
- Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- Tropical linear maps on the plane (Q550671) (← links)
- Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- A simpler and faster algorithm for optimal total-work-content-power due data determination (Q583099) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Cyclic orders (Q583246) (← links)
- Scheduling periodic events (Q584069) (← links)
- New crash procedures for large systems of linear constraints (Q584077) (← links)