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.
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- Multi-objective design of team oriented assembly systems. (Q1429934) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- Models for representing piecewise linear cost functions (Q1433660) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- Valid inequalities for a class of assembly system problems (Q1584810) (← links)
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs (Q1584813) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Simultaneous loading, routing, and assembly plan selection in a flexible assembly system (Q1596849) (← links)
- Optimal project selection when borrowing and lending rates differ (Q1596890) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- On the linear description of the 3-cycle polytope (Q1600839) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- A model and methodologies for the location problem with logistical components (Q1603315) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Short rational generating functions for solving some families of fuzzy integer programming problems (Q1677650) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
- Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Local search inequalities (Q1751111) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints (Q1754254) (← links)
- Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs (Q1762122) (← links)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem (Q1764761) (← links)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
- Applying the minimax criterion in stochastic recourse programs (Q1771344) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)