The following pages link to (Q4054818):
Displaying 47 items.
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- Designing communication networks for distributed control agents. (Q1420380) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (Q1683090) (← links)
- Green design of wireless local area networks by multiband robust optimization (Q1742229) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals (Q1753439) (← links)
- Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- A parallel optimization approach for controlling allele diversity in conservation schemes (Q1810726) (← links)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
- Optimization models for ATM network planning (Q1870814) (← links)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem (Q2370343) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Two new algorithms for UMTS access network topology design (Q2387233) (← links)
- Preference scheduling for nurses using column generation (Q2387240) (← links)
- Towards using the chordal graph polytope in learning decomposable models (Q2411269) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Modeling of period overlapping setup times (Q2503060) (← links)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- Solving a gas-lift optimization problem by dynamic programming (Q2503089) (← links)
- International trade and biological invasions: a queuing theoretic analysis of the prevention problem (Q2575563) (← links)
- Optimal inference for Simon's two-stage design with over or under enrollment at the second stage (Q5084781) (← links)
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) (Q5941313) (← links)
- Scheduling projects with labor constraints (Q5946815) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
