The following pages link to (Q4040221):
Displayed 50 items.
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Forecast horizons and dynamic facility location planning (Q689237) (← links)
- Ideal clutters (Q697573) (← links)
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems (Q700701) (← links)
- New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
- Locating active sensors on traffic networks (Q816421) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Integer-programming software systems (Q817202) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← 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)
- 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)