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.
- Minimum fractional dominating functions and maximum fractional packing functions (Q1025952) (← links)
- A discrete mechanics approach to dislocation dynamics in BCC crystals (Q1027011) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Mathematical models for selection of optimal place and size of connections considering the time-value of money (Q1044096) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- On-line fault detection in discrete event systems by Petri nets and integer linear programming (Q1049168) (← links)
- A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
- An intelligent interactive project management support system (Q1129303) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- A counterexample to a question of Merikoski and Virtanen on the compounds of unitary matrices (Q1189632) (← links)
- Vehicle crew scheduling to complete specific tasks and bulk-tasks at depots (Q1197664) (← links)
- 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)