Cover Inequalities for the Robust Knapsack Problem

Kyungchul Pa ,  k

Management Science and Financial Engineering

2008 .05

An Analysis of the Relationship between Problem Characteristics and Algorithm Performance : A Case Study on 0-1 Knapsack Problems

양재환 ,  김현수

한국경영과학회지

2006 .03

On the Stochastic Knapsack Value Function for Random Items of Multiple Classes

이태억

한국경영과학회 학술대회논문집

1993 .01

Multiple Choice Knapsack-based Heuristic Algorithm for Paper Cutting Optimization

김태훈 ,  김경덕 ,  김병인 외 1명

한국경영과학회 학술대회논문집

2013 .05

A Cutting-plane Generation Method for a Variable-capacity (0,1)-Knapsack Problem with General Integer Variables

Kyungsik Lee

Management Science and Financial Engineering

2004 .05

A Solution Approach for Cardinality Constrained Knapsack Problem

박찬우 ,  이영호 ,  박기경

한국경영과학회 학술대회논문집

2012 .05

On the Separation of the Rank-1 Chvatal-Gomory Inequalities for the Fixed-Charge 0-1 Knapsack Problem

박경철 ,  이경식

한국경영과학회지

2011 .06

Lifting Cover Inequalities for the Precedence - Constrained Knapsack Problem

박경철 ,  박성수

한국경영과학회 학술대회논문집

1994 .01

Ending on a High Note?

Benjamin Engel

EAI 기타간행물

2015 .12

A THANK YOU NOTE

송하나

아동학회지

2017 .08

Risk-Averse Knapsack Problem with Profit Interdiction

이영훈 ,  박성수

한국경영과학회 학술대회논문집

2017 .04

FPTAS and pseudo-polynomial separability of integral hull of generalized knapsack problem

홍성필

한국경영과학회 학술대회논문집

2004 .11

Polyhedral Studies on Robust Mixed Integer Programming Problems

정슬기 ,  박성수

한국경영과학회 학술대회논문집

2018 .10

[Session B1 생산일정/수리계획]About fully polynomial approximability of the generalized knapsack problem

Sung-Pil Hong ,  Bum Hwan Pa ,  k

한국경영과학회 학술대회논문집

2003 .11

다중제약 배낭문제를 위한 새로운 유전 알고리즘

이상욱 ,  석상문 ,  이주상 외 2명

한국경영과학회 학술대회논문집

2005 .05

Robust Version of the Bilevel Knapsack with Interdiction Constraints

Yeonghun Lee ,  Sungsoo Pa ,  k

한국경영과학회 학술대회논문집

2019 .04

An AI Approach with Tabu Search to Solve Multi-level Knapsack Problems : Using Cycle Detection , Short-term and Long-term Memory

고일상

한국경영과학회지

1997 .09

용량이 변화하는 ( 0 , 1 ) - 배낭문제에 대한 절단평면 생성방안 ( A Cut Generation Method for the ( 0 , 1 ) - Knapsack problem with a Variable Capacity )

이경식 ,  박성수

한국경영과학회지

2000 .09