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 graph-theoretic heuristic for designing loop-layout manufacturing systems (Q1197695) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix (Q1198041) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- Neural network methods in combinatorial optimization (Q1200816) (← links)
- A stochastic neural network for resource constrained scheduling (Q1200819) (← links)
- Vehicle routing problem with trailers (Q1268206) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Process planning in a fuzzy environment (Q1278081) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- A robustness approach to uncapacitated network design problems (Q1278322) (← links)
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- Reducing depot-related costs of large bus operators. A case study in Bangkok (Q1278452) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Optimizing nuclear power plant refueling with mixed-integer programming (Q1278616) (← links)
- Multi-objective optimization over convex disjunctive feasible sets using reference points (Q1278716) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem (Q1280190) (← links)
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks (Q1280194) (← links)
- The complexity of multidimensional periodic scheduling (Q1281399) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy (Q1291726) (← links)
- A lexicographic approach to bi-objective loading of a flexible assembly system (Q1296131) (← links)
- Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
- HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road (Q1303560) (← links)
- Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Investment planning for urban roads (Q1322152) (← links)
- Collapsing and lifting for the cut cone (Q1322220) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- A \(0-1\) goal programming model for scheduling multiple maintenance projects at a copper mine (Q1331564) (← links)
- MINTO, a Mixed INTeger Optimizer (Q1331882) (← links)
- Polyhedral structure and properties of a model for layout design (Q1333453) (← links)
- An algorithm for the planar three-index assignment problem (Q1333481) (← links)
- Geometric comparison of combinatorial polytopes (Q1339395) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- Some applications of nonnegative linear systems: Farkas strikes again (Q1342285) (← links)
- Partitioning of sequentially ordered systems using linear programming (Q1362974) (← links)
- Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)