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 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)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Channel allocation in cellular radio networks (Q1370712) (← links)
- On dominated terms in the general knapsack problem (Q1371953) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- Solution methods for the balancing of jet turbines (Q1373895) (← links)
- A model for the capacitated \(p\)-facility location problem in global environments (Q1374025) (← links)
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- A special class parametric of knapsack problems: Analytic aids and heuristics (Q1390270) (← links)
- The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
- \(k\)-interchange heuristic as an optimization procedure for material handling applications (Q1401081) (← links)
- Material compatibility constraints for make-to-order production planning. (Q1412704) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- Designing communication networks for distributed control agents. (Q1420380) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Loading and scheduling of a flexible assembly system by mixed integer programming. (Q1420407) (← links)
- Pricing combinatorial auctions. (Q1420433) (← links)
- Mathematical models for applying cell suppression methodology in statistical data protection. (Q1420457) (← links)
- On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463) (← links)
- Using penalty function and tabu search to solve cell formation problems with fixed cell cost. (Q1422379) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- Cutting planes from a mixed integer Farkas lemma. (Q1426721) (← links)