Pages that link to "Item:Q3923934"
From MaRDI portal
The following pages link to Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms (Q3923934):
Displayed 50 items.
- A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems (Q1803268) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
- Deterministic network interdiction (Q1804095) (← links)
- On the minors of an incidence matrix and Smith normal form (Q1805203) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← links)
- Consistency problems in ER-schemas for database systems (Q1827327) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
- A search heuristic for the sequence-dependent economic lot scheduling problem (Q1848619) (← links)
- Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line (Q1848633) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Graph imperfection. I (Q1850556) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Two alternative models for farm management: Discrete versus continuous time horizon (Q1869414) (← links)
- Stock selection heuristics for interdependent items (Q1869495) (← links)
- Discrete models for data imputation (Q1885809) (← links)
- Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems (Q1885820) (← links)
- A column generation approach to the coalition formation problem in multi-agent systems (Q1885967) (← links)
- Hybrid genetic algorithm for optimization problems with permutation property (Q1886509) (← links)
- Minimizing maximum indegree (Q1887077) (← links)
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- Batch scheduling to minimize total completion time (Q1890951) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- The application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Cardinality-restricted chains and antichains in partially ordered sets (Q1917285) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- On solving the continuous data editing problem (Q1919203) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Real-time freight locomotive rescheduling and uncovered train detection during disruption (Q1926901) (← links)
- A simple finite cutting plane algorithm for integer programs (Q1939718) (← links)
- Relocation problems arising in conservation biology (Q1963365) (← links)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
- An exact solution framework for the multiple gradual cover location problem (Q2003421) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)