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)
- Inverse integer programming (Q732771) (← 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)
- Routing of uncertain traffic demands (Q833385) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics (Q835788) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- Efficient reformulation and solution of a nonlinear PDE-controlled flow network model (Q841133) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- 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)