Pages that link to "Item:Q5894455"
From MaRDI portal
The following pages link to Combinatorial optimization. Theory and algorithms. (Q5894455):
Displayed 50 items.
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies (Q139209) (← links)
- Inverse portfolio problem with coherent risk measures (Q321032) (← links)
- Scheduling under linear constraints (Q323163) (← links)
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
- Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test (Q343120) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Lack of fit tests for linear regression models with many predictor variables using minimal weighted maximal matchings (Q739581) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Robustifying sum-product networks (Q1726242) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
- A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
- The decomposition problem for the set of paths in a directed graph and its application (Q1735230) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
- Investigation on irreducible cost vectors in minimum cost arborescence problems (Q1753571) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Flow-firing processes (Q2005187) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (Q2043801) (← links)
- Combinatorial optimization algorithms for detecting collapse mechanisms of concrete slabs (Q2046697) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Constructing the basis path set by eliminating the path dependency (Q2109299) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- Algorithm NextFit for the bin packing problem (Q2119556) (← links)
- Interpreting the basis path set in neural networks (Q2121160) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- How to minimize cycle times of robot manufacturing systems (Q2139147) (← links)
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds (Q2149869) (← links)
- Exploiting complete linear descriptions for decentralized power market problems with integralities (Q2155382) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
- Approximating connected safe sets in weighted trees (Q2184684) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)