The following pages link to (Q4254875):
Displaying 50 items.
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture (Q2060774) (← links)
- A bi-integrated model for coupling lot-sizing and cutting-stock problems (Q2063089) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- Integrated rolling stock deadhead routing and timetabling in urban rail transit lines (Q2076825) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- A subsidy policy to managing hazmat risk in railroad transportation network (Q2116873) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- A combinatorial optimization approach to scenario filtering in portfolio selection (Q2146965) (← links)
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times (Q2147000) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Shattering inequalities for learning optimal decision trees (Q2170186) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- Feeder routing for air-to-air refueling operations (Q2171624) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- A transformation-proximal bundle algorithm for multistage adaptive robust optimization and application to constrained robust optimal control (Q2173978) (← links)
- Optimal collection of medical specimens and delivery to central laboratory (Q2178326) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
- Mixed-integer optimization methods for online scheduling in large-scale HVAC systems (Q2182775) (← links)
- Particle filter-based data assimilation technique for the evaluation of transport of pollutants in small rivers (Q2204173) (← links)
- Strategic planning of an underground mine with variable cut-off grades (Q2218873) (← links)
- Simple majority rule and integer programming (Q2243526) (← links)
- Integrated facility location and capacity planning under uncertainty (Q2244999) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- A Davidson college multi-objective assignment problem: a case study (Q2257101) (← links)
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling (Q2257354) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Valuing portfolios of interdependent real options using influence diagrams and simulation-and-regression: a multi-stage stochastic integer programming approach (Q2289885) (← links)
- The time buffer approximated buffer allocation problem: a row-column generation approach (Q2289911) (← links)
- Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
- Modeling formulation and a new heuristic for the railroad blocking problem (Q2295212) (← links)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction (Q2342595) (← links)
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction (Q2342646) (← links)
- Quantile lower bounds to reliability based on locally optimal splits (Q2348191) (← links)
- A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272) (← links)
