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.
- Unimodularity of the Clar number problem (Q861006) (← links)
- Locating landfills--optimization vs. reality (Q864021) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing (Q872122) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- A computationally efficient robust tube based MPC for linear switched systems (Q901258) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- A note on the MIR closure (Q924876) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Lagrangian approaches for a class of matching problems in computational biology (Q929184) (← links)
- Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Solving the car sequencing problem via branch \& bound (Q932220) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks (Q969908) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Conley's spectral sequence via the sweeping algorithm (Q989093) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
- Scheduling of corrugated paper production (Q1011222) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- 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)