Pages that link to "Item:Q2574644"

The following pages link to Combinatorial optimization. Theory and applications. (Q2574644):

Displaying 48 items.

• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
• Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
• A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← links)
• Flows in 3-edge-connected bidirected graphs (Q537628) (← links)
• A Ramsey bound on stable sets in Jordan pillage games (Q637574) (← links)
• Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
• Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• Minimizing the total weighted completion time in the relocation problem (Q964872) (← links)
• Approximating optimum branchings in linear time (Q976065) (← links)
• Wavelet BEM on molecular surfaces: parametrization and implementation (Q1034733) (← links)
• Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
• On the probabilistic min spanning tree problem (Q1935723) (← links)
• New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
• Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals (Q2078501) (← links)
• Degree and regularity of Eulerian ideals of hypergraphs (Q2094866) (← links)
• A duality theorem for the ic-resurgence of edge ideals (Q2111193) (← links)
• Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
• Distribution of a heterogeneous set of resources in multiprocessor scheduling (Q2134302) (← links)
• Arborescences of covering graphs (Q2136408) (← links)
• Nowhere-zero unoriented 6-flows on certain triangular graphs (Q2151207) (← links)
• Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
• Optimization of the structure of a real-time multiprocessor system (Q2171299) (← links)
• Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
• Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes (Q2254912) (← links)
• FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
• Zero-sum 6-flows in 5-regular graphs (Q2317918) (← links)
• Improved approximation algorithms for constrained fault-tolerant resource allocation (Q2348043) (← links)
• Matroid representation of clique complexes (Q2381814) (← links)
• Nowhere-zero 15-flow in 3-edge-connected bidirected graphs (Q2452411) (← links)
• Optimizing compatible sets in wireless networks through integer programming (Q2513731) (← links)
• Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
• Complexity of constrained sensor placement problems for optimal observability (Q2665404) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Theoretical and computational advances for network diversion (Q2811311) (← links)
• Power Indices in Spanning Connectivity Games (Q3638444) (← links)
• Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
• Lightweight paths in graphs (Q5106693) (← links)
• Оптимизация загрузки упорядоченной совокупности летательных аппаратов (Q5112293) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
• On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
• Eulerian ideals (Q5879424) (← links)
• Robust Independence Systems (Q5892606) (← links)
• Solution Enumeration by Optimality in Answer Set Programming (Q6063865) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
• Reachability in Simple Neural Networks (Q6070612) (← links)
• Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions (Q6195850) (← links)