The following pages link to (Q4943600):
Displaying 50 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229) (← links)
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Valid inequalities for the synchronization bus timetabling problem (Q322699) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- A trilevel programming approach for electric grid defense planning (Q336810) (← links)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples (Q373884) (← links)
- A Newton method for solving continuous multiple material minimum compliance problems (Q373922) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Global optima for the Zhou-Rozvany problem (Q381557) (← links)
- Two-stage stochastic lot-sizing problem under cost uncertainty (Q383162) (← links)
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- Exact algorithms for inventory constrained scheduling on a single machine (Q398845) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- School choice with controlled choice constraints: hard bounds versus soft bounds (Q406428) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- The value function of an infinite-horizon single-item lot-sizing problem (Q433828) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
- Stochastic robustness metric and its use for static resource allocations (Q436874) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Multiple UAV coalitions for a search and prosecute mission (Q441436) (← links)
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- A novel probabilistic formulation for locating and sizing emergency medical service stations (Q492857) (← links)
- On dynamically generating relevant elementary flux modes in a metabolic network using optimization (Q500343) (← links)
- Exact augmented Lagrangian duality for mixed integer linear programming (Q507329) (← links)
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming (Q518129) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- The directed orienteering problem (Q547309) (← links)
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP) (Q601161) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Optimal crop planting schedules and financial hedging strategies under ENSO-based climate forecasts (Q666497) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- Order selection in nonlinear time series models with application to the study of cell memory (Q714378) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- A well-defined composite indicator: an application to corporate social responsibility (Q779876) (← links)
- On the balanced minimum evolution polytope (Q783026) (← links)
