The following pages link to (Q4040221):
Displaying 50 items.
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- Computing sparse and dense realizations of reaction kinetic systems (Q848181) (← links)
- Cross-layer packet scheduling for downlink multiuser OFDM systems (Q848469) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- On some geometry and equivalence classes of normal form games (Q857567) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- Decision support system for mass dispensing of medications for infectious disease outbreaks and bioterrorist attacks (Q863587) (← links)
- Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
- Hypergraphs and the Clar problem in hexagonal systems (Q865759) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- On `informationally robust equilibria' for bimatrix games (Q868625) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Space-aware ambients and processes (Q875514) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- A hybrid clustering algorithm (Q883287) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Reverse split rank (Q896287) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Facets of the axial three-index assignment polytope (Q908296) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Global solution of optimization problems with signomial parts (Q924639) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach (Q930950) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- A multi-stop routing problem (Q940857) (← links)
- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope (Q941053) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- A weighted even factor algorithm (Q948958) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Computing robust basestock levels (Q951115) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- A mixed integer programming model for multiple stage adaptive testing (Q958075) (← links)
- On cardinality constrained cycle and path polytopes (Q964176) (← links)
